Blick ins Buch

Arithmetic of Finite Fields

Second International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings

Joachim von zur Gathen, José Luis Imana, Cetin Kaya Koc (Herausgeber)

Buch | Softcover

X, 205 Seiten

2008 | 2008
Springer Berlin (Verlag)
978-3-540-69498-4 (ISBN)

Lese- und Medienproben

Blick ins Buch (midvox)

Artikel merken

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.

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 ).

Erscheint lt. Verlag	25.6.2008
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	X, 205 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	338 g
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
Schlagworte	Algebra • algebraic computation • algebraic number theory • Algorithm analysis and problem complexity • Algorithmic Number Theory • binary polynomials • classification • Complexity • Computational Algebra • Computational Number Theory • Computer Algebra • Cryptographic Codes • cryptography • curve-based cryptography • cyclic codes • discrete Fourier transform • distributed networking • Elliptic Curves • Factoring • Finite Fields • Galois field • Gröbner Bases • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • hyperelliptic curves • interpolation polynomials • LA • lattices • Modular Forms • number theoretic transform • Public-Key Cryptography • random network coding • sequences • Symmetric functions
ISBN-10	3-540-69498-6 / 3540694986
ISBN-13	978-3-540-69498-4 / 9783540694984
Zustand	Neuware