Next Article in Journal
Lanchester Models for Irregular Warfare
Next Article in Special Issue
Representations of Generalized Self-Shrunken Sequences
Previous Article in Journal
Research on Advertising and Quality of Paid Apps, Considering the Effects of Reference Price and Goodwill
Article

A Group Law on the Projective Plane with Applications in Public Key Cryptography

1
Departamento de Automática, Universidad de Alcalá, E-28871 Alcalá de Henares, Spain
2
Instituto de Tecnologías Físicas y de la Información (ITEFI) Consejo Superior de Investigaciones Científicas (CSIC), E-28006 Madrid, Spain
*
Authors to whom correspondence should be addressed.
A preliminary version of this manuscript can be found at arXiv.org under the URL: https://arxiv.org/abs/1802.00246.
Mathematics 2020, 8(5), 734; https://doi.org/10.3390/math8050734
Received: 25 March 2020 / Revised: 2 May 2020 / Accepted: 2 May 2020 / Published: 7 May 2020
(This article belongs to the Special Issue Mathematics Cryptography and Information Security)
In the context of new threats to Public Key Cryptography arising from a growing computational power both in classic and in quantum worlds, we present a new group law defined on a subset of the projective plane F P 2 over an arbitrary field F , which lends itself to applications in Public Key Cryptography and turns out to be more efficient in terms of computational resources. In particular, we give explicitly the number of base field operations needed to perform the mentioned group law. Based on it, we present a Diffie-Hellman-like key agreement protocol. We analyze the computational difficulty of solving the mathematical problem underlying the proposed Abelian group law and we prove that the security of our proposal is equivalent to the discrete logarithm problem in the multiplicative group of the cubic extension of the finite field considered. We present an experimental setup in order to show real computation times along a comparison with the group operation in the group of points of an elliptic curve. Based on current state-of-the-art algorithms, we provide parameter ranges suitable for real world applications. Finally, we present a promising variant of the proposed group law, by moving from the base field F to the ring Z / p q Z , and we explain how the security becomes enhanced, though at the cost of a longer key length. View Full-Text
Keywords: abelian group law; discrete logarithm problem; norm of an extension; projective cubic curve abelian group law; discrete logarithm problem; norm of an extension; projective cubic curve
Show Figures

Figure 1

MDPI and ACS Style

Durán Díaz, R.; Hernández Encinas, L.; Muñoz Masqué, J. A Group Law on the Projective Plane with Applications in Public Key Cryptography. Mathematics 2020, 8, 734. https://doi.org/10.3390/math8050734

AMA Style

Durán Díaz R, Hernández Encinas L, Muñoz Masqué J. A Group Law on the Projective Plane with Applications in Public Key Cryptography. Mathematics. 2020; 8(5):734. https://doi.org/10.3390/math8050734

Chicago/Turabian Style

Durán Díaz, Raúl, Luis Hernández Encinas, and Jaime Muñoz Masqué. 2020. "A Group Law on the Projective Plane with Applications in Public Key Cryptography" Mathematics 8, no. 5: 734. https://doi.org/10.3390/math8050734

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop