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 Rédei 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.

Group law on affine conics and applications to cryptography / Bellini, E.; Murru, N.; Di Scala, A. J.; Elia, M.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - ELETTRONICO. - 409:(2021). [10.1016/j.amc.2020.125537]

Group law on affine conics and applications to cryptography

Murru N.;Di Scala A. J.;Elia M.
2021

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 Rédei 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.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0096300320304938-main(1).pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 662.96 kB
Formato Adobe PDF
662.96 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
AAMN70.pdf

Open Access dal 23/07/2022

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Creative commons
Dimensione 196.02 kB
Formato Adobe PDF
196.02 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2922698