Randomized cryptosystem based on linear transformation

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The secure transmission of any form of data over a communication medium is primary important across the globe or in research arena. Cryptography is a branch of cryptology and it provides security for data transmission between any communicating parties. The Hill cipher is one of the symmetric key substitution algorithms. Hill Cipher is vulnerable to known plaintext attack. This paper presents randomized cryptosystem based on linear transformation using variable length sub key groups. The proposed technique shares a prime circulant matrix as a secret key. The security analysis and performance of the method are studied and presented.

Cite

CITATION STYLE

APA

Reddy, K. A. N., Vishnuvardhan, B., & Prasad, G. S. C. (2016). Randomized cryptosystem based on linear transformation. In Advances in Intelligent Systems and Computing (Vol. 434, pp. 113–119). Springer Verlag. https://doi.org/10.1007/978-81-322-2752-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free