03608nam 2200625 a 450 991048374600332120200520144314.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)99267000000002891820100506d2010 uy 0engurnn|008mamaatxtccrArithmetic of finite fields Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010 : proceedings /M. Anwar Hasan, Tor Helleseth (eds.)1st ed.New York Springer20101 online resource (280 p. 41 illus.) Lecture notes in computer science,0302-9743 ;6087LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic 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.Lecture notes in computer science ;6087.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Finite fields (Algebra)CongressesMappings (Mathematics)CongressesCurves, AlgebraicCongressesFinite fields (Algebra)Mappings (Mathematics)Curves, Algebraic512.32Hasan M. Anwar1757028Helleseth Tor1221180MiAaPQMiAaPQMiAaPQBOOK9910483746003321Arithmetic of finite fields4198198UNINA