An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics

DOI10.1016/J.FFA.2016.01.011zbMATH Open1339.94036arXiv1511.03451OpenAlexW2964289175MaRDI QIDQ268490FDOQ268490

Authors: Emanuele Bellini, Nadir Murru 

Publication date: 15 April 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1511.03451

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

zbMATH Keywords

RSApublic cryptographyRédei function

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cites Work

• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• Fast evaluation of Rédei functions
• Title not available (Why is that?)
• Low-exponent RSA with related messages
• Generalized Rédei rational functions and rational approximations over conics
• Title not available (Why is that?)
• Solving the Pell equation via Rédei rational functions
• Title not available (Why is that?)
• Cryptanalysis of the Dickson-Scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Comment on “Cryptographic Applications of Brahmagupta–Bhãskara Equation”
• Cryptographic applications of Brahmagupta-Bha/spl tilde/skara equation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving the Pell equation

Cited In (13)

• Fixed points of rational functions satisfying the Carlitz property
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tangent-Chebyshev maps over finite fields: new properties and functional graphs
• Rédei permutations with cycles of the same length
• A note on the use of Rédei polynomials for solving the polynomial Pell equation and its generalization to higher degrees
• A novel RSA-like cryptosystem based on a generalization of the Rédei rational functions
• DLP-based cryptosystems with Pell cubics
• Primality tests, linear recurrent sequences and the Pell equation
• Pell hyperbolas in DLP-based cryptosystems
• Group law on affine conics and applications to cryptography
• Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers

Uses Software

• gmp

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)