Arithmetic of Finite Fields : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings

by Hasan, M. Anwar; Helleseth, Tor

• ISBN13: 9783642137969
• ISBN10: 3642137962
• Format: Paperback
• Copyright: 2010-07-08
• Publisher: Springer-Verlag New York Inc

Summary

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.

Table of Contents

Recuring Towers of function Fields over Finite Fields	p. 1
Efficient Finite Field Arithmetic
High-Performence Modular Multiplication on Cell Processor	p. 7
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier	p. 25
Type-II Optimal Polynomial Bases	p. 41
Pseudo-random Numbers and Sequences
Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers	p. 62
Structure of Pseudorandom Numbers Derived from Fermat Quotients	p. 73
Boolean Functions
Distribution of Boolean Function According to the Second-Order Nonlinearity	p. 86
Hyper-bent Boolean Functions with Multiple Trace Terms	p. 97
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings	p. 114
Functions Equations and Modular Multiplication
Switching Construction of Planar Functions on Finite Fields	p. 135
Solving Equation Systems by Agreeing and Learning	p. 151
Speeding Up Bipartite Modular Multiplication	p. 166
Finite Field Arthmetic for Pairing Based Cryptography
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography	p. 180
Delaying Mismatched Field Multiplications in Pairing Computations	p. 196
Regenerating Codes for Distributed Storage Networks	p. 215
Finite Fields, Cryptography and Coding
On Rationality of the Intersection Points of a Lion with a Plane Quartic	p. 224
Reflection about a Single Checksum	p. 238
Efficient Time-Area Scalable ECC Processor Using ¿ Coding Technique	p. 250
Author Index	p. 269
Table of Contents provided by Ingram. All Rights Reserved.