Sciweavers

190 search results - page 3 / 38
» Supersingular Elliptic Curves in Cryptography
Sort
View
IACR
2011
120views more  IACR 2011»
13 years 11 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
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...
David Jao, Luca De Feo
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
15 years 5 months ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
IEICET
2008
61views more  IEICET 2008»
14 years 11 months ago
Powered Tate Pairing Computation
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
Bo Gyeong Kang, Je Hong Park
SACRYPT
1999
Springer
15 years 4 months ago
Elliptic Curve Pseudorandom Sequence Generators
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m. We call these sequences elliptic curve...
Guang Gong, Thomas A. Berson, Douglas R. Stinson