Sciweavers

11 search results - page 1 / 3
» On Repeated Squarings in Binary Fields
Sort
View
SACRYPT
2009
Springer
142views Cryptology» more  SACRYPT 2009»
13 years 11 months ago
On Repeated Squarings in Binary Fields
Kimmo U. Järvinen
TC
2008
13 years 4 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
13 years 8 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee
CHES
2008
Springer
151views Cryptology» more  CHES 2008»
13 years 6 months ago
Binary Edwards Curves
Abstract. This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formula...
Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Fa...
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 6 months ago
Efficient Arithmetic on Hessian Curves
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
Reza Rezaeian Farashahi, Marc Joye