A Fast and Secure RSA Public Key Cryptosystem

被引:0
作者
Mohammadi, M. [1 ,3 ]
Zolghadrasli, A. [2 ]
Pourmina, M. A. [1 ,3 ]
机构
[1] Islamic Azad Univ, Tehran Branch, Tehran, Iran
[2] Shiraz Univ, Dept Commun & Elect, Fac Comp & Elect Engn, Elect Engn, Shiraz, Iran
[3] Islamic Azad Univ, Sci & Res Branch, Dept Elect Engn, Elect Engn, Tehran, Iran
关键词
Ryptography; RSA cryptosystem; public key; private key; prime numbers; encryption; decryption; modular reduction; SIGNATURES;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
RSA is a well-known public-key cryptosystem. It is the most commonly used and currently most important public-key algorithm which can be used for both encryption and signing. RSA cryptosystem involves exponentiation modulo an integer number n that is the product of two large primes p and q. The security of the system is based on the difficulty of factoring large integers in terms of its key size and the length of the modulus n in bits which is said to be the key size. In this paper, we present a method that increases the speed of RSA cryptosystem. Also, an efficient implementation of arithmetic and modular operations are used to increase its speed. The security is also enhanced by using a variable key size space. There exist numerous implementations (hardware or software) of RSA cryptosystem, but most of them are restricted in key size. An important improvement achieved in this paper is that the system is designed flexible in terms of key size according to user security.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 24 条
[1]  
ABUDIN Jainul, 2014, INT J COMPUTER SCI I, V5, P3548
[2]  
[Anonymous], 2015, IJISET INT J INNOV S
[3]  
BARRETT P, 1987, LECT NOTES COMPUT SC, V263, P311
[4]   Breaking RSA May Be As Difficult As Factoring [J].
Brown, Daniel R. L. .
JOURNAL OF CRYPTOLOGY, 2016, 29 (01) :220-241
[5]  
CAO Zhengjun, 2014, Paper 2014/040
[6]  
Cormen T. H., 2009, Introduction To Algorithms
[7]   How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction [J].
Coron, Jean-Sebastien ;
Holenstein, Thomas ;
Kuenzler, Robin ;
Patarin, Jacques ;
Seurin, Yannick ;
Tessaro, Stefano .
JOURNAL OF CRYPTOLOGY, 2016, 29 (01) :61-114
[8]   An Algebraic Framework for Diffie-Hellman Assumptions [J].
Escala, Alex ;
Herold, Gottfried ;
Kiltz, Eike ;
Rafols, Carla ;
Villar, Jorge .
JOURNAL OF CRYPTOLOGY, 2017, 30 (01) :242-288
[9]  
Gura N., 2004, CHES 2004
[10]  
Hasenplaugh W., 2007, 18 IEEE S COMP AR AR