Arithmetic of Finite Fields 2nd International Workshop, WAIFI 2008 Siena, Italy, July 6-9, 2008 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gathen, Joachim von zur (Επιμελητής έκδοσης), Imaña, José Luis (Επιμελητής έκδοσης), Koç, Çetin Kaya (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5130
• Θέματα: Computer science.; Data encryption (Computer science).; Coding theory.; Algorithms.; Computer science > Mathematics.; Computer Science.; Coding and Information Theory.; Data Encryption.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; Symbolic and Algebraic Manipulation.

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

Πίνακας περιεχομένων:

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