ACISP
2009
Springer
13 years 11 months ago
2009
Springer
This paper provides new results about efficient arithmetic on (extended) Jacobi quartic form elliptic curves y2 = dx4 + 2ax2
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...