Joan Daemen, Guido Bertoni, Michaël Peeters and Gilles Van Assche. Inside Keccak
Henning Stichtenoth. Old and New Towers over Finite Fields
Christophe ARENE, David KOHEL and Christophe RITZENTHALER. Complete addition laws on abelian varieties over finite fields
Gary McGuire, Vijaykumar Singh and Alexey Zaytsev. On The Characteristic Polynomial of Frobenius of Supersingular Abelian Varieties Of Dimension up to 7 over Finite Fields
Julia Pieltant and Stéphane Ballet. On the tensor rank of multiplication in any extension of GF(2)
Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret and Jean-Pierre Tillich. Algebraic Cryptanalysis of Compact McEliece’s Variants : Toward a Complexity Analysis
Ferruh Ozbudak, Elif Saygi and Zulfukar Saygi. Quadratic Forms of Codimension 2 over Certain Finite Fields of Even Characteristic
Francois Rodier. Some More Functions That Are Not APN Infinitely Often
Stéphanie Dib. Asymptotic Behaviour of Boolean Functions Nonlinearity in Parallel with First-order Reed-Muller Codes Decoding Capability
Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystem
Christelle Rovetta and Marc Mouffron. De Bruijn Sequences and Complexity of Symmetric Functions
Nadia El Mrabet. About the security of pairing based cryptography
Tom Blackford. Cyclic Codes over the 2-adic Numbers
Cem Guneri and Ferruh Ozbudak. Weight estimates for cyclic codes via Weil-Serre bound for additive equations
Ayca Cesmelioglu, Wilfried Meidl and Alev Topuzoglu. On a Class of APN Permutation Polynomials
Gohar Kyureghyan. On the projection construction of planar and APN mappings
Jeremy Parriaux, Philippe Guillot and Gilles Millerioux. Towards a Spectral Approach for the Design of Self-Synchronizing Stream-Ciphers
Gregory Bard. DEMOCRACY : A Heuristic for Polynomial Systems of Equations over Finite Fields (Extended Abstract)
Yves Aubry. On the higher term of the differential spectrum of a function
Vincent Verneuil. Elliptic Curve Cryptography on Standard Curves Using the Edwards Addition Law
Morgan Barbier. New Set of Codes for the Maximum-Likelihood Decoding Problem
Horacio Tapia-Recillas. On the Quasi-cyclicity of the Gray Image of Codes over Finite Chain Rings
Stéphane Ballet and Robert Rolland. A note on Yao’s theorem about pseudo-random generators
