Encryption based on Conference Matrix
Shipra Kumari, Hrishikesh Mahato

TL;DR
This paper introduces an encryption scheme utilizing conference matrices, which offers high security and robustness against common cryptanalytic attacks, by employing a decryption key based on prime power positive integers.
Contribution
It presents a novel encryption method based on conference matrices with a secure key structure, enhancing cryptographic robustness.
Findings
Resistant to popular cipher attacks
High security due to prime power key structure
Robust against cryptanalysis
Abstract
In this article, an encryption scheme based on (-1, 1) conference matrix has been developed. The decryption key comprising of fixed number of positive integers with prime power yields the high level security of message. Some popular attacks has been discussed in the context of cryptoanalysis and observed that it is robust against the popular cipher attack and the security of the information does not compromise.
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
TopicsDNA and Biological Computing · Cellular Automata and Applications · Cooperative Communication and Network Coding
