04338nam 22008055 450 99646566710331620230221174146.01-280-38738-697866135653033-642-13797-010.1007/978-3-642-13797-6(CKB)2670000000028918(SSID)ssj0000446306(PQKBManifestationID)11312192(PQKBTitleCode)TC0000446306(PQKBWorkID)10506304(PQKB)11352311(DE-He213)978-3-642-13797-6(MiAaPQ)EBC3065456(PPN)14906408X(EXLCZ)99267000000002891820100626d2010 u| 0engurnn|008mamaatxtccrArithmetic of Finite Fields[electronic resource] Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings /edited by M. Anwar Hasan, Tor Helleseth1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (280 p. 41 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6087Bibliographic Level Mode of Issuance: Monograph3-642-13796-2 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;6087Computer programmingComputer science—MathematicsDiscrete mathematicsAlgorithmsCryptographyData encryption (Computer science)Computer networksProgramming TechniquesSymbolic and Algebraic ManipulationDiscrete Mathematics in Computer ScienceAlgorithmsCryptologyComputer Communication NetworksComputer programming.Computer science—Mathematics.Discrete mathematics.Algorithms.Cryptography.Data encryption (Computer science).Computer networks.Programming Techniques.Symbolic and Algebraic Manipulation.Discrete Mathematics in Computer Science.Algorithms.Cryptology.Computer Communication Networks.512.32Hasan M. Anwaredthttp://id.loc.gov/vocabulary/relators/edtHelleseth Toredthttp://id.loc.gov/vocabulary/relators/edtBOOK996465667103316Arithmetic of Finite Fields774277UNISA