On Constructing Prime Order Elliptic Curves Suitable for Pairing-Based Cryptography

Author(s):  
Meng Zhang ◽  
Xuehong Chen ◽  
Maozhi Xu ◽  
Jie Wang
Author(s):  
Elisavet Konstantinou ◽  
Aristides Kontogeorgis ◽  
Yannis C. Stamatiou ◽  
Christos Zaroliagis
Keyword(s):  

2018 ◽  
Vol 12 (3) ◽  
pp. 309-318
Author(s):  
Josep M. Miret ◽  
Daniel Sadornil ◽  
Juan G. Tena

Author(s):  
Keisuke Hakuta

Elliptic curves have a wide variety of applications in computational number theory such as elliptic curve cryptography, pairing based cryptography, primality tests, and integer factorization. Mishra and Gupta (2008) have found an interesting property of the sets of elliptic curves in simplified Weierstrass form (or short Weierstrass form) over prime fields. The property is that one can induce metrics on the sets of elliptic curves in simplified Weierstrass form over prime fields of characteristic greater than three. Later, Vetro (2011) has found some other metrics on the sets of elliptic curves in simplified Weierstrass form over prime fields of characteristic greater than three. However, to our knowledge, no analogous result is known in the characteristic two case. In this paper, we will prove that one can induce metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two.


2009 ◽  
Vol 23 (3) ◽  
pp. 477-503 ◽  
Author(s):  
Elisavet Konstantinou ◽  
Aristides Kontogeorgis ◽  
Yannis C Stamatiou ◽  
Christos Zaroliagis

Sign in / Sign up

Export Citation Format

Share Document