000 04436nam a22006735i 4500
001 978-3-540-69499-1
003 DE-He213
005 20240730192117.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540694991
_9978-3-540-69499-1
024 7 _a10.1007/978-3-540-69499-1
_2doi
050 4 _aQA268
050 4 _aQ350-390
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aGPF
_2thema
082 0 4 _a003.54
_223
245 1 0 _aArithmetic of Finite Fields
_h[electronic resource] :
_bSecond International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings /
_cedited by Joachim von zur Gathen, José Luis Imana, Cetin Kaya Koc.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aX, 205 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5130
505 0 _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 ).
520 _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.
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 1 4 _aCoding and Information Theory.
_9148610
650 2 4 _aCryptology.
_931769
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _avon zur Gathen, Joachim.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148611
700 1 _aImana, José Luis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148612
700 1 _aKoc, Cetin Kaya.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148613
710 2 _aSpringerLink (Online service)
_9148614
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540694984
776 0 8 _iPrinted edition:
_z9783540865735
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5130
_9148615
856 4 0 _uhttps://doi.org/10.1007/978-3-540-69499-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94075
_d94075