TY  - BOOK
AU  - Hasan,M.Anwar
AU  - Helleseth,Tor
ED  - SpringerLink (Online service)
TI  - Arithmetic of Finite Fields: Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642137976
AV  - QA76.9.M35 
U1  - 005.131 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Data structures (Computer science)
KW  - Data encryption (Computer science)
KW  - Computer software
KW  - Computational complexity
KW  - Algebra
KW  - Data processing
KW  - Computer Science
KW  - Symbolic and Algebraic Manipulation
KW  - Discrete Mathematics in Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Data Encryption
KW  - Data Structures, Cryptology and Information Theory
N1  - Invited Talk 1 -- Recursive Towers of Function Fields over Finite Fields -- Efficient Finite Field Arithmetic -- High-Performance Modular Multiplication on the Cell Processor -- A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier -- Type-II Optimal Polynomial Bases -- Pseudo-random Numbers and Sequences -- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers -- Structure of Pseudorandom Numbers Derived from Fermat Quotients -- Boolean Functions -- Distribution of Boolean Functions According to the Second-Order Nonlinearity -- Hyper-bent Boolean Functions with Multiple Trace Terms -- Invited Talk 2 -- On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings -- Functions, Equations and Modular Multiplication -- Switching Construction of Planar Functions on Finite Fields -- Solving Equation Systems by Agreeing and Learning -- Speeding Up Bipartite Modular Multiplication -- Finite Field Arithmetic for Pairing Based Cryptography -- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography -- Delaying Mismatched Field Multiplications in Pairing Computations -- Invited Talk 3 -- Regenerating Codes for Distributed Storage Networks -- Finite Fields, Cryptography and Coding -- On Rationality of the Intersection Points of a Line with a Plane Quartic -- Reflections about a Single Checksum -- Efficient Time-Area Scalable ECC Processor Using ?-Coding Technique
UR  - http://dx.doi.org/10.1007/978-3-642-13797-6
ER  -