A novel and efficient cryptosystem for large message encryption

Authors:
Debasish Jena;Sanjay Kumar Jena
Affiliations:
Department of Computer Science and Engineering, International Institute of Information Technology, Bhubaneswar, 751003, Orissa, India.;Department of Computer Science and Engineering, National Institute of Technology, Rourkela, 769008, Orissa, India
Venue:
International Journal of Information and Communication Technology
Year:
2011

Citing 5
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptography: Theory and Practice,Second Edition

Cryptography: Theory and Practice,Second Edition
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Use of Elliptic Curves in Cryptography

CRYPTO '85 Advances in Cryptology
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to more overhead of asymmetric cryptosystems, traditionally, the symmetric cryptosystem is used to encrypt large messages. But the key management, i.e., the key should be available at both sender and receiver before communication is the most difficult part of symmetric cryptosystem. So, to encrypt large messages, we usually take the help of both symmetric and asymmetric cryptosystems. In this paper, we proposed an asymmetric cryptosystem for encrypting large messages, which is not only efficient but also secure as compared to other asymmetric cryptosystems. In consideration of the aspect of efficiency and computation, our proposed scheme uses elliptic curve cryptosystem.