An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
From MaRDI portal
(Redirected from Publication:268490)
Abstract: We define an isomorphism between the group of points of a conic and the set of integers modulo a prime equipped with a non-standard product. This product can be efficiently evaluated through the use of R'edei rational functions. We then exploit the isomorphism to construct a novel RSA-like scheme. We compare our scheme with classic RSA and with RSA-like schemes based on the cubic or conic equation. The decryption operation of the proposed scheme turns to be two times faster than RSA, and involves the lowest number of modular inversions with respect to other RSA-like schemes based on curves. Our solution offers the same security as RSA in a one-to-one communication and more security in broadcast applications.
Recommendations
- A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
- A multi-factor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola
- A complete and explicit security reduction algorithm for RSA-based cryptosystems
- scientific article; zbMATH DE number 4002226
- Analogue of the RSA-cryptosystem in quadratic unique factorization domains
- scientific article; zbMATH DE number 1047547
- Publication:4934742
- Continued fractions applied to a family of RSA-like cryptosystems
- RSA cryptosystem for Dedekind rings
- scientific article; zbMATH DE number 1088247
Cites work
- scientific article; zbMATH DE number 1676654 (Why is no real title available?)
- scientific article; zbMATH DE number 2085418 (Why is no real title available?)
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 3972789 (Why is no real title available?)
- scientific article; zbMATH DE number 4035724 (Why is no real title available?)
- scientific article; zbMATH DE number 176555 (Why is no real title available?)
- scientific article; zbMATH DE number 1394325 (Why is no real title available?)
- scientific article; zbMATH DE number 3099304 (Why is no real title available?)
- A Comment on “Cryptographic Applications of Brahmagupta–Bhãskara Equation”
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of the Dickson-Scheme
- Cryptographic applications of Brahmagupta-Bha/spl tilde/skara equation
- Fast evaluation of Rédei functions
- Generalized Rédei rational functions and rational approximations over conics
- Low-exponent RSA with related messages
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving the Pell equation
- Solving the Pell equation via Rédei rational functions
Cited in
(13)- A note on the use of Rédei polynomials for solving the polynomial Pell equation and its generalization to higher degrees
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- Primality tests, linear recurrent sequences and the Pell equation
- Rédei permutations with cycles of the same length
- Pell hyperbolas in DLP-based cryptosystems
- scientific article; zbMATH DE number 3972789 (Why is no real title available?)
- scientific article; zbMATH DE number 4002226 (Why is no real title available?)
- scientific article; zbMATH DE number 1047547 (Why is no real title available?)
- DLP-based cryptosystems with Pell cubics
- Tangent-Chebyshev maps over finite fields: new properties and functional graphs
- A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
- Fixed points of rational functions satisfying the Carlitz property
- Group law on affine conics and applications to cryptography
This page was built for publication: An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268490)
