Research Article
A Novel Symmetric Key Cryptography using Multiple Random Secret Keys
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 80 - Issue 16 |
| Published: October 2013 |
| Authors: A. S. N. Chakravarthy, T. Anjikumar |
10.5120/13954-1890
|
A. S. N. Chakravarthy, T. Anjikumar . A Novel Symmetric Key Cryptography using Multiple Random Secret Keys. International Journal of Computer Applications. 80, 16 (October 2013), 27-32. DOI=10.5120/13954-1890
@article{ 10.5120/13954-1890,
author = { A. S. N. Chakravarthy,T. Anjikumar },
title = { A Novel Symmetric Key Cryptography using Multiple Random Secret Keys },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 80 },
number = { 16 },
pages = { 27-32 },
doi = { 10.5120/13954-1890 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A A. S. N. Chakravarthy
%A T. Anjikumar
%T A Novel Symmetric Key Cryptography using Multiple Random Secret Keys%T
%J International Journal of Computer Applications
%V 80
%N 16
%P 27-32
%R 10.5120/13954-1890
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Cryptography is an essential practice required for secure communication between two parties. It preserves the confidentiality, integrity, availability, and authenticity of information thereby enhances the security of the data processing system and the information flow within an organization. Symmetric and asymmetric key cryptography are used for encryption and decryption of a message. Symmetric key cryptography is the most commonly used cryptography as it is fast and feasible for use in decrypting bulk messages and requires less computer resources. Chosen-plaintext attacks have been proposed for symmetric key cryptography as it uses single secret key to encrypt different messages. This paper introduces a novel symmetric key cryptography, where multiple random secret keys can be used to encrypt different messages, which is insecure under cipher text-only attacks, a weaker form of attack than chosen-plaintext attacks.
References
- The Mohammad Zakir Hossain Sarker and Md. Shafiul Parvez, "A Cost Effective Symmetric Key Cryptographic Algorithm for Small Amount of Data", 9th International Multitopic Conference, IEEE INMIC 2005, 24-25 Dec. 2005, pp. 1-6.
- R. Cramer, V. Shoup, "Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack" SIAM Journal on Computing Vol 33 2001.
- H. A. Bergen and J. M. Hogan, "A chosen plaintext attack on an adaptive arithmetic coding compression algorithm," Comput. Security, vol. 12, pp. 157–167, 1993.
- J. Katz and Y. Lindell, Introduction to Modern Cryptography. London, U. K. : Chapman & Hall/CRC, 2008.
- S. Goldwasser and S. Micali, "Probabilistic Encryption", Journal of Computer and System Sciences, Vol 28, 1994, pp 270-299.
- S. William, Cryptography and Network Security: Principles and Practice, 2nd edition, Prentice-Hall, Inc. ,1999, pp 23-50.
- Network Security Essentials (Applications and Standards) by William Stallings Pearson Education.
- Introduction to Cryptography, Buchmann, Springer.
- M. I. Jabiullah, S. M. Mizanur Rahman, M. Lutfar Rahman and M. Alamgir Hossain, "Secure Pseudoorandom Bit Generation for Cryptographic Application", Proceedings of International Conference on Computer and Information Technology (ICCIT), Dhaka, 2001 pp 275-277.
- Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inform Theory 22(6):644–654
- R. Merkle, "Secure communication over an insecure channel,"submitted to Communications of the ACM.
- Feistel, H. Cryptography and computer privacy. Sci. Amer. 228, 5 (May 1973), 15-23.
Index Terms
Keywords