IACR
2011
12 years 9 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
IACR
2011
12 years 9 months ago
2011
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very ef cient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. G...
JSS
2011
13 years 19 days ago
2011
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
JSC
2011
13 years 19 days ago
2011
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
EUROCRYPT
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
ACISP
2011
Springer
13 years 1 months ago
2011
Springer
We propose a generic three-pass key agreement protocol that is based on a certain kind of trapdoor one-way function family. When specialized to the RSA setting, the generic protoco...
MOC
2010
13 years 4 months ago
2010
We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1-2U points, when p = U2 + dV 2 with 2U, 2V ...
MOC
2010
13 years 4 months ago
2010
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower...
MOC
2010
13 years 4 months ago
2010
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
JOC
2010
13 years 4 months ago
2010
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...