This book constitutes the refereed proceedings of the Third International Workshop on the Arithmetic of Finite Fields, WAIFI 2010, held in Istanbul, Turkey, in June 2010. The 15 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers are organized in topical sections on efficient finite field arithmetic, pseudo-random numbers and sequences, Boolean functions, functions, Equations and modular multiplication, finite field arithmetic for pairing based cryptography, and finite field, cryptography and coding.
Author(s): Henning Stichtenoth (auth.), M. Anwar Hasan, Tor Helleseth (eds.)
Series: Lecture Notes in Computer Science 6087 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 280
Tags: Symbolic and Algebraic Manipulation; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Data Encryption; Computer Communication Networks; Data Structures, Cryptology and Information Theory
Front Matter....Pages -
Recursive Towers of Function Fields over Finite Fields....Pages 1-6
High-Performance Modular Multiplication on the Cell Processor....Pages 7-24
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier....Pages 25-40
Type-II Optimal Polynomial Bases....Pages 41-61
Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers....Pages 62-72
Structure of Pseudorandom Numbers Derived from Fermat Quotients....Pages 73-85
Distribution of Boolean Functions According to the Second-Order Nonlinearity....Pages 86-96
Hyper-bent Boolean Functions with Multiple Trace Terms....Pages 97-113
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings....Pages 114-134
Switching Construction of Planar Functions on Finite Fields....Pages 135-150
Solving Equation Systems by Agreeing and Learning....Pages 151-165
Speeding Up Bipartite Modular Multiplication....Pages 166-179
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography....Pages 180-195
Delaying Mismatched Field Multiplications in Pairing Computations....Pages 196-214
Regenerating Codes for Distributed Storage Networks....Pages 215-223
On Rationality of the Intersection Points of a Line with a Plane Quartic....Pages 224-237
Reflections about a Single Checksum....Pages 238-249
Efficient Time-Area Scalable ECC Processor Using μ -Coding Technique....Pages 250-268
Back Matter....Pages -
