A Vector Space Approach to Generate Dynamic Keys for Hill Cipher
Sunil Kumar, Sandeep Kumar, Gaurav Mittal, Shiv Narain

TL;DR
This paper introduces a novel variant of the Hill cipher that uses dynamically generated invertible matrices based on vector spaces, enhancing security against known-plaintext attacks.
Contribution
It proposes a method to generate dynamic key matrices using vector spaces, improving Hill cipher security against known-plaintext attacks.
Findings
Enhanced security against known-plaintext attack
Use of vector space-based matrix generation
Dynamic key matrices for each plaintext block
Abstract
In this paper, a variant of the Hill cipher is proposed. In the classical Hill cipher, an invertible matrix is used for encryption but the scheme is vulnerable to the known-plaintext attack which can reveal the matrix. In our proposed cryptosystem, each plaintext block is encrypted by a new invertible key matrix that thwarts the known-plaintext attack. To generate the invertible matrices which serve as the dynamic keys we make use of the vector spaces, randomly generated basis and non-singular linear transformation. Resulting cipher is secure against the known-plaintext attack.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Chaos-based Image/Signal Encryption · Coding theory and cryptography
