Proceedings ArticleDOI
An Efficient RSA Public Key Encryption Scheme
Sattar J. Aboud,Moustafa Al-Fayoumi,Mustafa Al-Fayoumi,Haidar S. Jabbar +3 more
- pp 127-130
Reads0
Chats0
TLDR
The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers and is claimed to be efficient, scalable and dynamic.Abstract:
In this paper, we propose an efficient RSA public key encryption scheme, which is improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in zn indicated via l(h, zn) . Since the original RSA Scheme is a block cipher in which the original message and cipher message are integer in the interval [0, n -1] for some integer modulus n. Therefore, in this paper, we generalize RSA encryption scheme in order to be implemented in the general linear group on the ring of integer mod n. Furthermore, the suggested encryption scheme has no restriction in encryption and decryption order and is claimed to be efficient, scalable and dynamic.read more
Citations
More filters
[서평]「Applied Cryptography」
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Proceedings ArticleDOI
An algorithm to enhance security in RSA
TL;DR: This paper proposes a secure algorithm that tries to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm.
Journal ArticleDOI
A Hybrid Encryption Algorithm Based on RSA Small-e and Efficient-RSA for Cloud Computing Environments
TL;DR: The main aim of this project is to use the cryptography concepts in cloud computing communications and to increase the security of encrypted data in cloud servers with the least consumption of time and cost at the both of encryption and decryption processes.
Proceedings ArticleDOI
A comparative study of applying real-time encryption in cloud computing environments
TL;DR: E-RSA in the most appropriate algorithm for using in client-based data encryption service by achieving acceleration, accuracy, and security in this service based on compatibility issues in a client side service.
Proceedings ArticleDOI
A hybrid security algorithm for RSA cryptosystem
TL;DR: This paper presents a new Hybrid security algorithm for RSA cryptosystem named as Hybrid RSA (HRSA), where computation of "public key" as well as "private key" depends on the value of M, where M is the product of four prime numbers.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Book
Cryptography: Theory and Practice
TL;DR: The object of the book is to produce a general, comprehensive textbook that treats all the essential core areas of cryptography.
[서평]「Applied Cryptography」
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Digitalized signatures and public-key functions as intractable as factorization
TL;DR: It is proved that for any given n, if the authors can invert the function y = E (x1) for even a small percentage of the values y then they can factor n, which seems to be the first proved result of this kind.