Generation of Efficient Key Bit-Streams Using Sparse Matrix-Vector Multiplication
M. Sivasankar, T. R. Padmanabhan

TL;DR
This paper introduces a matrix-based stream cipher leveraging sparse matrix-vector multiplication for efficient key stream generation, offering high speed and parallelism, with analysis of its resistance to attacks and potential for video encryption.
Contribution
It presents a novel matrix-based stream cipher that uses sparse matrix-vector multiplication to generate key streams efficiently and in parallel.
Findings
Resistant to various cryptographic attacks
Enables fast parallel key stream generation
Applicable for encrypting video streams
Abstract
The contribution of Stream ciphers to cryptography is immense. For fast encryption, stream ciphers are preferred to block ciphers due to their XORing operation, which is easier and faster to implement. In this paper we present a matrix based stream cipher, in which a m x n binary matrix single handedly performs the work of m parallel LFSRs. The resistivity of the proposed stream cipher to various possible attacks are analyzed. Interestingly the output of the matrix multiplication can otherwise be used as a parallel bit/byte generator, useful for encrypting video streams.
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
TopicsQuantum-Dot Cellular Automata · Low-power high-performance VLSI design · Quantum Computing Algorithms and Architecture
