Arithmetic of finite fields : 2nd international workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008 : proceedings / Joachim von zur Gathen, José Luis Imaña, Çetin Kaya Koç (eds.).
Annotation
Saved in:
Main Authors: | , |
---|---|
Corporate Author: | |
Other Authors: | |
Format: | Ebook |
Language: | English |
Published: |
Berlin ; New York :
Springer,
[2008]
|
Series: | Lecture notes in computer science ;
5130. LNCS sublibrary. Theoretical computer science and general issues. |
Subjects: | |
Online Access: | Springer eBooks |
Table of Contents:
- 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).