Group law on affine conics and applications to cryptography

Abstract In this paper, we highlight that the point group structure of elliptic curves, over finite or infinite fields, may be also observed on reducible cubics with an irreducible quadratic component. Starting from this, we introduce in a very general way a group’s structure over any kind of conic. In the case of conics over finite fields, we see that the point group is cyclic and lies on the quadratic component. Thanks to this, some applications to cryptography are described, considering convenient parametrizations of the conics. We perform an evaluation of the complexity of the operations involved in the parametric groups and consequently in the cryptographic applications. In the case of the hyperbolas, the Redei rational functions can be used for performing the operations of encryption and decryption, and the More’s algorithm can be exploited for improving the time costs of computation. Finally, we provide also an improvement of the More’s algorithm.

[1]  R. Vijayaragavan,et al.  Pell's RSA key generation and its security analysis , 2013, 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT).

[2]  Edward J Barbeau Pell's Equation , 2003 .

[3]  Willibald More,et al.  Fast evaluation of Rédei functions , 1995, Applicable Algebra in Engineering, Communication and Computing.

[4]  Emanuele Bellini,et al.  An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics , 2016, Finite Fields Their Appl..

[5]  Sahadeo Padhye A Public Key Cryptosystem Based on Pell Equation , 2006, IACR Cryptol. ePrint Arch..

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

[7]  N. Rama Murthy,et al.  Cryptographic applications of Brahmagupta-Bhatskara equation. , 2006 .

[8]  Tanja Lange,et al.  Faster Addition and Doubling on Elliptic Curves , 2007, ASIACRYPT.

[9]  Alfred Menezes,et al.  A note on cyclic groups, finite fields, and the discrete logarithm problem , 2005, Applicable Algebra in Engineering, Communication and Computing.

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

[11]  Emanuele Bellini,et al.  A multifactor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola , 2019, NUMTA.

[12]  N. Demytko,et al.  A New Elliptic Curve Based Analogue of RSA , 1994, EUROCRYPT.

[13]  Barbero Stefano,et al.  Solving the Pell equation via Rédei rational functions , 2010 .

[14]  Michael J. Jacobson,et al.  Solving the Pell Equation , 2008 .

[15]  K V S S R S S Sarma,et al.  Public Key Cryptosystem based on Pell's Equation Using The Gnu Mp Library , 2011 .

[16]  Kenji Koyama,et al.  Fast RSA-type Schemes Based on Singular Cubic Curves y2+axy=m³(mod n) , 1995, EUROCRYPT.