Ebook: Arithmetic of Finite Fields: 2nd International Workshop, WAIFI 2008 Siena, Italy, July 6-9, 2008 Proceedings
- Tags: Coding and Information Theory, Data Encryption, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Symbolic and Algebraic Manipulation, Algorithms
- Series: Lecture Notes in Computer Science 5130
- Year: 2008
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
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.
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.
Content:
Front Matter....Pages -
Interpolation of the Double Discrete Logarithm....Pages 1-10
Finite Dedekind Sums....Pages 11-18
Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications....Pages 19-35
Fast Point Multiplication on Elliptic Curves without Precomputation....Pages 36-46
Optimal Extension Field Inversion in the Frequency Domain....Pages 47-61
Efficient Finite Fields in the Maxima Computer Algebra System....Pages 62-76
Modular Reduction in GF(2 n ) without Pre-computational Phase....Pages 77-87
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation....Pages 88-102
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields....Pages 103-116
Some Theorems on Planar Mappings....Pages 117-122
Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions....Pages 123-133
EA and CCZ Equivalence of Functions over GF(2 n )....Pages 134-143
On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials....Pages 144-156
On Field Size and Success Probability in Network Coding....Pages 157-173
Montgomery Ladder for All Genus 2 Curves in Characteristic 2....Pages 174-188
On Cryptographically Significant Mappings over GF(2 n )....Pages 189-204
Back Matter....Pages -
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.
Content:
Front Matter....Pages -
Interpolation of the Double Discrete Logarithm....Pages 1-10
Finite Dedekind Sums....Pages 11-18
Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications....Pages 19-35
Fast Point Multiplication on Elliptic Curves without Precomputation....Pages 36-46
Optimal Extension Field Inversion in the Frequency Domain....Pages 47-61
Efficient Finite Fields in the Maxima Computer Algebra System....Pages 62-76
Modular Reduction in GF(2 n ) without Pre-computational Phase....Pages 77-87
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation....Pages 88-102
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields....Pages 103-116
Some Theorems on Planar Mappings....Pages 117-122
Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions....Pages 123-133
EA and CCZ Equivalence of Functions over GF(2 n )....Pages 134-143
On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials....Pages 144-156
On Field Size and Success Probability in Network Coding....Pages 157-173
Montgomery Ladder for All Genus 2 Curves in Characteristic 2....Pages 174-188
On Cryptographically Significant Mappings over GF(2 n )....Pages 189-204
Back Matter....Pages -
....