Del 0 - Lecture Notes in Computer Science

Arithmetic of Finite Fields

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

Häftad, Engelska, 2008

AvJoachim von zur Gathen,José Luis Imana,Cetin Kaya Koc,Joachim Von Zur Gathen,Joachim von zur Gathen

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2008-06-25
Mått155 x 235 x 12 mm
Vikt335 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor205
Upplaga2008
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540694984

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik
Referensverk och tvärvetenskap inom Samhälle och politik
IT-säkerhet inom Data och IT

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