5 search results - page 1 / 1 » Comparing the MOV and FR Reductions in Elliptic Curve Crypto... |
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we discuss two ways to provide flexible hardware support for the reduction step in Elliptic Curve Cryptography in binary fields (GF(2m )). In our first approach w...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
TC
2010
12 years 11 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
PKC
2009
Springer
14 years 5 months ago
2009
Springer
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...