35 search results - page 6 / 7 » On the Construction of Prime Order Elliptic Curves |
PKC
2010
Springer
13 years 9 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
WAIFI
2010
Springer
13 years 10 months ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, the twisted Jacobi intersections which contains Jacobi intersections as a special case is introduced. We show that every elliptic curve over the prime field with t...
IACR
2011
12 years 5 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...
PAIRING
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...