Sciweavers

1400 search results - page 18 / 280
» On multiplication in finite fields
Sort
View
ARC
2007
Springer
140views Hardware» more  ARC 2007»
15 years 8 months ago
A Fast Finite Field Multiplier
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
Edgar Ferrer, Dorothy Bollman, Oscar Moreno
ASIACRYPT
2004
Springer
15 years 7 months ago
On the Generalized Linear Equivalence of Functions Over Finite Fields
Luca Breveglieri, Alessandra Cherubini, Marco Macc...
92
Voted
CHES
2004
Springer
140views Cryptology» more  CHES 2004»
15 years 7 months ago
Instruction Set Extensions for Fast Arithmetic in Finite Fields GF( p) and GF(2m)
Johann Großschädl, Erkay Savas
71
Voted
CRYPTO
2004
Springer
109views Cryptology» more  CRYPTO 2004»
15 years 7 months ago
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
In this paper, we study the bounded sum-of-digits discrete logarithm problem in finite fields. Our results concern primarily with
Qi Cheng