Program.

Sunday 6th July, 2008

19:30 Reception cocktail.

Monday 7th July, 2008

08:30 - 09:55 Registration.

09:55 - 10:00 Welcome.

10:00 - 11:00 Invited Talk by Amin Shokrollahi.

11:00 - 11:30 Coffee Break.

Session 1: Structures in Finite Fields

11:30 - 12:00 Gerasimos C. Meletiou and Arne Winterhof.
Interpolations of the Double Discrete Logarithm.

12:00 - 12:30 Yoshinori Hamahata.
Finite Dedeking sums.

12:30 -13:00 Marc Mouffron.
Transitive q-ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications.

13:00 - 14:30 Lunch Break

Session 2: Efficient Finite Field Arithmetic

14:30 - 15:00 Marc Joye.
Fast Point Multiplication on Elliptic Curves Without Precomputation.

15:00 - 15:30 Selçuk Baktir and Berk Sunar.
Optimal Extension Field Inversion in the Frequency Domain.

15:30 - 16:00 Fabrizio Caruso, Jacopo D'Aurizio, and Alasdair McAndrew.
Efficient Finite Fields in the Maxima Computer Algebra System.

20:00 Gala Dinner

Tuesday 8th July, 2008

Session 3: Efficient Implementations and Architectures

09:30 - 10:00 M. Knežević, K. Sakiyama, J. Fan and I. Verbauwhede.
Modular Reduction in GF(2n ) Without Pre-Computational Phase.

10:00 - 10:30 M. Anwar Hasan and Christophe Negre.
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation.

10:30 - 11:00 Arash Hariri and Arash Reyhani-Masoleh.
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields.

11:00 - 11:30 Coffee Break

Session 4: Classification and Construction of Mappings over Finite Fields

11:30 - 12:00 Gohar M. Kyureghyan and Alexander Pott.
Some Theorems on Planar Mappings.

12:00 - 12:30 Bora Aslan, M. Tolga Sakalli, and Ercan Bulus.
Classifying 8-bit to 8-bit S-boxes based on Power Mappings from the point of DDT and LAT Distributions.

12:30 - 13:00 K. J. Horadam.
EA and CCZ equivalence of functions over GF (2n ).

13:00 - 14:30 Lunch

Wednesday 9th July, 2007

Session 5: Codes and Cryptography

09:30 - 10:00 Gerardo Vega.
On the Number of Two-weight Cyclic Codes with Composite Parity-check Polynomials.

10:00 - 10:30 Olav Geil, Ryutaroh Matsumoto, Casper Thomsen.
On Field Size and Success Probability in Network Coding.

10:30 - 11:00 Sylvain Duquesne.
Montgomery Ladder for all Genus 2 Curves in Characteristic 2.

11:00 - 11:30 Enes Pasalic.
On cryptographically significant mappings over GF(2n ).

11:30 Closing of the workshop.