Second International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings Herausgegeben:Zur Gathen, Joachim von; Imana, José Luis; Koc, Cetin Kaya
Second International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings Herausgegeben:Zur Gathen, Joachim von; Imana, José Luis; Koc, Cetin Kaya
This 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.
This 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.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
Produktdetails
Theoretical Computer Science and General Issues 5130
Artikelnr. des Verlages: 12323364, 978-3-540-69498-4
2008
Seitenzahl: 216
Erscheinungstermin: 25. Juni 2008
Englisch
Abmessung: 235mm x 155mm x 12mm
Gewicht: 338g
ISBN-13: 9783540694984
ISBN-10: 3540694986
Artikelnr.: 24383427
Herstellerkennzeichnung
Die Herstellerinformationen sind derzeit nicht verfügbar.
Inhaltsangabe
Structures 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 ).
Structures 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 ).
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826