LEADER 04619nam 22007815 450 001 996466076203316 005 20230406022517.0 010 $a3-540-69499-4 024 7 $a10.1007/978-3-540-69499-1 035 $a(CKB)1000000000490338 035 $a(SSID)ssj0000355441 035 $a(PQKBManifestationID)11272647 035 $a(PQKBTitleCode)TC0000355441 035 $a(PQKBWorkID)10319853 035 $a(PQKB)11272391 035 $a(DE-He213)978-3-540-69499-1 035 $a(MiAaPQ)EBC3068533 035 $a(PPN)12705474X 035 $a(EXLCZ)991000000000490338 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aArithmetic of Finite Fields$b[electronic resource] $eSecond International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings /$fedited by Joachim von zur Gathen, José Luis Imana, Cetin Kaya Koc 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (X, 205 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5130 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-69498-6 320 $aIncludes bibliographical references and index. 327 $aStructures in Finite Fields -- Interpolation of the Double Discrete Logarithm -- Finite Dedekind Sums -- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications -- Efficient Finite Field Arithmetic -- Fast Point Multiplication on Elliptic Curves without Precomputation -- Optimal Extension Field Inversion in the Frequency Domain -- Efficient Finite Fields in the Maxima Computer Algebra System -- Efficient Implementation and Architectures -- Modular Reduction in GF(2 n ) without Pre-computational Phase -- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation -- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields -- Classification and Construction of Mappings over Finite Fields -- Some Theorems on Planar Mappings -- Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions -- EA and CCZ Equivalence of Functions over GF(2 n ) -- Codes and Cryptography -- On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials -- On Field Size and Success Probability in Network Coding -- Montgomery Ladder for All Genus 2 Curves in Characteristic 2 -- On Cryptographically Significant Mappings over GF(2 n ). 330 $aThis book constitutes the refereed proceedings of the Second International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, held in Siena, Italy, in July 2008. The 16 revised full papers presented were carefully reviewed and selected from 34 submissions. The papers are organized in topical sections on structures in finite fields, efficient finite field arithmetic, efficient implementation and architectures, classification and construction of mappings over finite fields, and codes and cryptography. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5130 606 $aCoding theory 606 $aInformation theory 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aCoding and Information Theory 606 $aCryptology 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aSymbolic and Algebraic Manipulation 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 14$aCoding and Information Theory. 615 24$aCryptology. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aSymbolic and Algebraic Manipulation. 676 $a003.54 702 $avon zur Gathen$b Joachim$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aImana$b José Luis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKoc$b Cetin Kaya$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466076203316 996 $aArithmetic of Finite Fields$9774277 997 $aUNISA