LEADER 04313nam  22008055  450 
001 9910483746003321
005 20230221174146.0
010   $a1-280-38738-6
010   $a9786613565303
010   $a3-642-13797-0
024 7 $a10.1007/978-3-642-13797-6
035   $a(CKB)2670000000028918
035   $a(SSID)ssj0000446306
035   $a(PQKBManifestationID)11312192
035   $a(PQKBTitleCode)TC0000446306
035   $a(PQKBWorkID)10506304
035   $a(PQKB)11352311
035   $a(DE-He213)978-3-642-13797-6
035   $a(MiAaPQ)EBC3065456
035   $a(PPN)14906408X
035   $a(EXLCZ)992670000000028918
100   $a20100626d2010      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aArithmetic of Finite Fields $eThird International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings /$fedited by M. Anwar Hasan, Tor Helleseth
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (280 p. 41 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6087
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-13796-2 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6087
606   $aComputer programming
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aAlgorithms
606   $aCryptography
606   $aData encryption (Computer science)
606   $aComputer networks
606   $aProgramming Techniques
606   $aSymbolic and Algebraic Manipulation
606   $aDiscrete Mathematics in Computer Science
606   $aAlgorithms
606   $aCryptology
606   $aComputer Communication Networks
615  0$aComputer programming.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aAlgorithms.
615  0$aCryptography.
615  0$aData encryption (Computer science).
615  0$aComputer networks.
615 14$aProgramming Techniques.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithms.
615 24$aCryptology.
615 24$aComputer Communication Networks.
676   $a512.32
702   $aHasan$b M. Anwar$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHelleseth$b Tor$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910483746003321
996   $aArithmetic of Finite Fields$9774277
997   $aUNINA