An efficient and secure RSA-like cryptosystem exploiting Redei rational functions over conics

被引:17
作者
Bellini, Emanuele
Murru, Nadir
机构
关键词
Redei function; RSA; Public cryptography; LOW-EXPONENT RSA; CRYPTOGRAPHIC APPLICATIONS; CRYPTANALYSIS;
D O I
10.1016/j.ffa.2016.01.011
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 Redei 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. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:179 / 194
页数:16
相关论文
共 36 条
  • [1] Known-plaintext attack to two cryptosystems based on the BB equation
    Alvarez, G.
    Encinas, L. Hernandez
    Masque, J. Munoz
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2008, 55 (05) : 423 - 426
  • [2] [Anonymous], 2006, PUBLIC KEY CRYPTOSYS
  • [3] [Anonymous], ADV CRYPTOLOGY CRYPT
  • [4] Barbero S., 2010, INT J PURE APPL MATH, V64, P305
  • [5] Barbero S, 2010, FIBONACCI QUART, V48, P348
  • [6] Biswas R., 2003, NATL WORKSHOP CRYPTO, P1
  • [7] Chaya Kumari R., 2012, INT J COMPUT APPL, V54
  • [8] Small solutions to polynomial equations, and low exponent RSA vulnerabilities
    Coppersmith, D
    [J]. JOURNAL OF CRYPTOLOGY, 1997, 10 (04) : 233 - 260
  • [9] Coppersmith D, 1996, LECT NOTES COMPUT SC, V1070, P1
  • [10] Demytko N., 1994, Advances in Cryptology - EUROCRYPT '93. Workshop on the Theory and Application of Cryptographic Techniques Proceedings, P40