Arithmetic of Finite Fields - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540694984, 9783540694991

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

EA and CCZ Equivalence of Functions over GF(2 n )

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_12 ◽

2008 ◽

pp. 134-143 ◽

Cited By ~ 3

Author(s):

K. J. Horadam

Keyword(s):

Ccz Equivalence

Fast Point Multiplication on Elliptic Curves without Precomputation

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_4 ◽

2008 ◽

pp. 36-46 ◽

Cited By ~ 5

Author(s):

Marc Joye

Keyword(s):

Elliptic Curves ◽

Point Multiplication

Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_3 ◽

2008 ◽

pp. 19-35 ◽

Cited By ~ 4

Author(s):

Marc Mouffron

Keyword(s):

Finite Fields ◽

Finite Sets

Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_11 ◽

2008 ◽

pp. 123-133 ◽

Cited By ~ 4

Author(s):

Bora Aslan ◽

M. Tolga Sakalli ◽

Ercan Bulus

On Cryptographically Significant Mappings over GF(2 n )

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_16 ◽

2008 ◽

pp. 189-204 ◽

Cited By ~ 4

Author(s):

Enes Pasalic

Modular Reduction in GF(2 n ) without Pre-computational Phase

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_7 ◽

2008 ◽

pp. 77-87 ◽

Cited By ~ 10

Author(s):

M. Knežević ◽

K. Sakiyama ◽

J. Fan ◽

I. Verbauwhede

Finite Dedekind Sums

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_2 ◽

2008 ◽

pp. 11-18 ◽

Cited By ~ 2

Author(s):

Yoshinori Hamahata

Keyword(s):

Dedekind Sums

Some Theorems on Planar Mappings

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_10 ◽

2008 ◽

pp. 117-122 ◽

Cited By ~ 13

Author(s):

Gohar M. Kyureghyan ◽

Alexander Pott

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_8 ◽

2008 ◽

pp. 88-102 ◽

Cited By ~ 4

Author(s):

M. Anwar Hasan ◽

Christophe Negre

Keyword(s):

Space Complexity ◽

Polynomial Representation ◽

Dickson Polynomial ◽

Binary Fields

Montgomery Ladder for All Genus 2 Curves in Characteristic 2

Arithmetic of Finite Fields - Lecture Notes in Computer Science ◽

10.1007/978-3-540-69499-1_15 ◽

2008 ◽

pp. 174-188 ◽

Cited By ~ 3

Author(s):

Sylvain Duquesne

Keyword(s):

Montgomery Ladder ◽

Genus 2 ◽

Characteristic 2 ◽

Genus 2 Curves

Arithmetic of Finite Fields - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

EA and CCZ Equivalence of Functions over GF(2 n )

Fast Point Multiplication on Elliptic Curves without Precomputation

Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications

Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions

On Cryptographically Significant Mappings over GF(2 n )

Modular Reduction in GF(2 n ) without Pre-computational Phase

Finite Dedekind Sums

Some Theorems on Planar Mappings

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

Montgomery Ladder for All Genus 2 Curves in Characteristic 2

Arithmetic of Finite Fields - Lecture Notes in Computer Science
Latest Publications