Arithmetic of Finite Fields: Third International Workshop, Waifi 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings: Third In by M. Anwar HasanArithmetic of Finite Fields: Third International Workshop, Waifi 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings: Third In by M. Anwar Hasan

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

byM. Anwar HasanEditorTor Helleseth

Paperback | June 17, 2010

Pricing and Purchase Info

$117.50

Earn 588 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Arithmetic of Finite Fields: Third International Workshop, Waifi 2010, Istanbul, Turkey, June 27-30…Format:PaperbackDimensions:280 pagesPublished:June 17, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642137962

ISBN - 13:9783642137969

Look for similar items by category:

Reviews

Table of Contents

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.