Accepted Papers

Ulrich Tamm.
Reflections about a Single Checksum.

Zhixiong Chen, Alina Ostafe and Arne Winterhof.
Structure of Pseudorandom Numbers Derived from Fermat Quotients.

Thorsten Ernst Schilling and Håvard Raddum.
Solving Equation Systems by Agreeing and Learning.

Sihem Mesnager.
Hyper-bent Boolean Functions with Multiple Trace Terms.

Joppe Bos.
High-Performance Modular Multiplication on the Cell Processor.

Roger Oyono and Ritzenthaler Christophe.
On Rationality of the Intersection Points of a Line with a Plane Quartic.

Craig Costello, Colin Boyd, Juan Manuel González Nieto and Kenneth Koon-Ho Wong.
Delaying Mismatched Field Multiplications in Pairing Computations.

Alexander Pott and Yue Zhou.
Switching Construction of Planar Functions on Finite Fields.

Stéphanie Dib.
Distribution of Boolean Functions According to Their Second-order Nonlinearity.

Naomi Benger and Michael Scott.
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography.

Mohamed Hassan and Mohammed Benaissa.
Efficient Time-Area Scalable ECC Processor Using Micro-coding Technique.

Miroslav Knezevic, Frederik Vercauteren and Ingrid Verbauwhede.
Speeding Up Bipartite Modular Multiplication.

Daniel Bernstein and Tanja Lange.
Type-II Optimal Polynomial Bases.

Reza Azarderakhsh and Arash Reyhani-Masoleh.
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier.

Alina Ostafe.
Triangular Polynomial Systems and Pseudorandom Sequences.