The cryptographic security of truncated linearly related variables
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Cryptanalysis of an elliptic curve cryptosystem for wireless sensor networks
International Journal of Security and Networks
Pseudorandom bit generation using coupled congruential generators
IEEE Transactions on Circuits and Systems II: Express Briefs
Customizable elliptic curve cryptosystems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
The advantages of elliptic curve cryptography for wireless security
IEEE Wireless Communications
New directions in cryptography
IEEE Transactions on Information Theory
Hiding information and signatures in trapdoor knapsacks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Enhancing security is the main intention for public key cryptosystems on the basis of the hardness of the obstinate computational problems. In this paper, the ASCII value depiction of the text message is mapped into a point on elliptic curve and this initiates a few order of complexity yet before the message is encrypted. Next, the process of encryption/decryption of a mapped elliptic curve point is illustrated by enhancing security using comparative linear congruential generator and then subjecting it to the knapsack algorithm. These steps introduce scrupulous confusion and diffusion to smash any attempt at brute force attacks. This paper also discusses the security aspects of the proposed cryptosystem which is secure against all kinds of attacks.