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, Emanuele; Di Scala, Antonio; Elia, Michele; Murru, Nadir. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - 2020/409:(2021), pp. 12553701-12553710. [10.1016/j.amc.2020.125537]
Group law on affine conics and applications to cryptography
Bellini, Emanuele;Murru, Nadir
2021-01-01
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 | Dimensione | Formato | |
---|---|---|---|
main-revised-elia.pdf
Open Access dal 16/11/2023
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
195.96 kB
Formato
Adobe PDF
|
195.96 kB | Adobe PDF | Visualizza/Apri |
1-s2.0-S0096300320304938-main.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
662.96 kB
Formato
Adobe PDF
|
662.96 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione