WAIFI 2008: Siena, Italy

Structures in Finite Fields

• Gerasimos C. Meletiou, Arne Winterhof:
  Interpolation of the Double Discrete Logarithm. 1-10
  
• Yoshinori Hamahata:
  Finite Dedekind Sums. 11-18
  
• Marc Mouffron:
  Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications. 19-35
  

Efficient Finite Field Arithmetic

• Marc Joye:
  Fast Point Multiplication on Elliptic Curves without Precomputation. 36-46
  
• Selçuk Baktir, Berk Sunar:
  Optimal Extension Field Inversion in the Frequency Domain. 47-61
  
• Fabrizio Caruso, Jacopo D'Aurizio, Alasdair McAndrew:
  Efficient Finite Fields in the Maxima Computer Algebra System. 62-76
  

Efficient Implementation and Architectures

• Miroslav Knezevic, Kazuo Sakiyama, Junfeng Fan, Ingrid Verbauwhede:
  Modular Reduction in GF(2ⁿ) without Pre-computational Phase. 77-87
  
• M. Anwar Hasan, Christophe Nègre:
  Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. 88-102
  
• Arash Hariri, Arash Reyhani-Masoleh:
  Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. 103-116
  

Classification and Construction of Mappings over Finite Fields

• Gohar M. M. Kyureghyan, Alexander Pott:
  Some Theorems on Planar Mappings. 117-122
  
• Bora Aslan, M. Tolga Sakalli, Ercan Bulus:
  Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions. 123-133
  
• K. J. Horadam:
  EA and CCZ Equivalence of Functions over GF(2ⁿ). 134-143
  

Codes and Cryptography

• Gerardo Vega:
  On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials. 144-156
  
• Olav Geil, Ryutaroh Matsumoto, Casper Thomsen:
  On Field Size and Success Probability in Network Coding. 157-173
  
• Sylvain Duquesne:
  Montgomery Ladder for All Genus 2 Curves in Characteristic 2. 174-188
  
• Enes Pasalic:
  On Cryptographically Significant Mappings over GF(2ⁿ). 189-204