Program (PDF version)

Thursday 21st June, 2007

09:00 - 09:30 Registration

09:30 - 09:40 Welcome

09:40 - 10:40 Invited Talk by Harald Niederreiter
"Factorization of polynomials over finite fields using differential equations"

Session 1: Structures in Finite Fields

10:40 - 11:05 Robert W. Fitzgerald, Joseph L. Yucas.
Explicit factorizations of cyclotomic and Dickson polynomials over finite fields.

11:05 - 11:30 Yoshinori Hamahata.
A note on modular forms on finite upper half planes.

11:30 - 11:55 Coffee Break

Session 2: Efficient Implementation and Architectures

11:55 - 12:20 Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, and Eiji Okamoto.
A Coprocessor for the Final Exponentiation of the ηT Pairing in Characteristic Three.

12:20 - 12:45 Stefan Tillich and Johann Groszschaedl
VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-bit Processors

12:45 - 13:10 Joachim von zur Gathen, Amin Shokrollahi, and Jamshid Shokrollahi.
Efficient multiplication using type 2 optimal normal bases.

13:10 - 14:45 Lunch Break

Session 3: Efficient Finite Field Arithmetic

14:45 - 15:10 Roberto Avanzi, and Nicolas Theriault.
Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic.

15:10 - 15:35 Omran Ahmadi, Darrel Hankerson, Alfred Menezes.
Software implementation of arithmetic in GF(3m).

15:35 - 16:00 Oscar Gustafsson and Mikael Olofsson.
Complexity Reduction of Constant Matrix Computations over the Binary Field.

16:00 - 16:25 Marco Bodrato
Towards Optimal Toom-Clock Multiplication for Univariate and Multivariate Polynimials in Characteristic 2 and 0.

16:25 - 16:55 Coffee Break

Session 4: Classification and Construction of Mappings over Finite Fields

16:55 - 17:20 Nobuo Nakagawa and Satoshi Yoshiara.
A construction of differentially 4-uniform functions from commutative semifields of characteristic 2.

17:20 - 17:45 Yuan Yuan, Tong Yan, Zhang Huanguo.
Complete mapping polynomials over finite field F16

17:45 - 18:10 Gregor Leander and Axel Poschmann.
On the Classification of 4 Bit S-boxes.

18:10 - 18:35 Lilya Budaghyan.
The simplest method for constructing APN polynomials EA-inequivalent to power functions.

20:45 Gala Dinner at Meliá Madrid Princesa Hotel
Rooms: Sala Cibeles I and Cibeles II




Friday 22st June, 2007

09:00 - 10:00 Invited Talk by Richard E. Blahut
"An Engineer Looks at the Turyn Representation"

Session 5: Curve Algebra

10:00 - 10:25 Nicolas Méloni.
New Point Addition Formulae for ECC and Applications.

10:25 - 10:50 Stefan Erickson, Michael Jacobson, Jr., Ning Shang, Sean Shen, Andreas Stein.
Explicit formulas for real hyperelliptic curves of genus 2 in affine representation.

10:50 - 11:15 Reza Rezaeian Farashahi and Ruud Pellikaan.
The Quadratic Extension Extractor for (Hyper)elliptic Curves in Odd Characteristic.

11:15 - 11:45 Coffee Break

Session 6: Cryptography

11:45 - 12:10Pierre-Louis Cayrel, Ayoub Otmani and Damien Vergnaud.
On Kabatianskii-Krouk-Smeets Signatures.

12:10 - 12:35Zuhua Shao.
Self-certified signatures based on discrete logarithms.

12:35 - 13:00Sondre Rønjom and Tor Helleseth.
Attacking the Filter Generator over GF(2m).

13:00 - 14:35 Lunch Break

Session 7: Codes

14:35 - 15:00 Juergen Bierbrauer.
Cyclic additive and quantum stabilizer codes.

15:00 - 15:25 Gerardo Vega.
Determining the Number of One-weight Cyclic Codes when Length and Dimension are Given.

15:25 - 15:50 V. Álvarez, J.A. Armario, M.D. Frau, E. Martín, A.Osuna.
Error correcting codes from quasi-Hadamard matrices.

15:50 - 16:15 Peizhong Lu, Yan Zou
Fast Computations of Grobner Bases and Blind Recognitions of Convolutional Codes.

16:15 - 16:45 Coffee Break

Session 8: Discrete Structures

16:45 - 17:10 R. Durán Díaz, J. Muñoz Masqué, A. Peinado Domínguez.
A twin for Euler's φ function in F2[X].

17:10 - 17:35 A. B. Klimov, J. L. Romero, G. Bjork, L.L. Sanchez-Soto
Discrete phase-space structure and mutually unbiased bases

17:35 - 18:00 Yuewen Tang and Dongyang Long.
Some Novel Results of p-adic Component of Primitive Sequences over Z/(pd).