Selection of Security Elliptic Curve Based on Evolution Algorithm

Applying evolution algorithm to selection of security elliptic curve (EC) is first researched in the paper. In order to ensure the security of elliptic curve cryptosystem (ECC), it is necessary that the elliptic curves are safe against all kinds of attack algorithms about the elliptic curve discrete logarithm problem (ECDLP). Therefore, selection of secure elliptic curves is a mathematics difficult problem. In this paper, selection principles of secure EC are firstly analyzed. Then, based on the selection principle, a selection algorithm of security EC based on evolution algorithm is put forward. The thoughts of encoding, crossover and mutation of evolution algorithm for selection of EC are discussed in detail. The implementation result shows the availability and efficiency of the algorithm.

[1]  Stephen C. Pohlig,et al.  An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance , 2022, IEEE Trans. Inf. Theory.

[2]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.

[3]  Arjen K. Lenstra.  Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems , 1999, ACISP.

[4]  Erkay Savas,et al.  Generating Elliptic Curves of Prime Order , 2001, CHES.

[5]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[6]  Takakazu Satoh,et al.  Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves , 1998 .

[7]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[8]  By J. M. Pollard.  Monte Carlo Methods for Index Computation (mod p) , 2010 .

[9]  Harald Baier,et al.  Efficient algorithms for generating elliptic curves over finite fields suitable for use in cryptography , 2002 .

[10]  Nigel P. Smart,et al.  The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.

[11]  Tibor Juhas.  The use of elliptic curves in cryptography , 2007 .

[12]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[13]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[14]  Christos D. Zaroliagis,et al.  On the Efficient Generation of Elliptic Curves over Prime Fields , 2002, CHES.

[15]  J. Pollard,et al.  Monte Carlo methods for index computation () , 1978 .

[16]  Igor A. Semaev,et al.  Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p , 1998, Math. Comput..

[17]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.