ENCRYPTION BASED ON CONFERENCE MATRIX 

By

Shipra Kumari and Hrishikesh Mahato 

Department of Mathematics, Central University of Jharkhand, Ranchi-835205, India 

Email:shipracuj@gmail.com; hrishikesh.mahato@cuj.ac.in 

(Received: December 19, 2021; Revised in format: December 30, 2021; Accepted: May 20, 2022)  

 DOI: https://doi.org/10.58250/Jnanabha.2022.52126

Abstract

In this article, an encryption scheme based on conference matrix has been developed. An easier algorithm of formation of encryption/decryption keys have been discussed. The decryption key comprising of fixed number of positive integers with prime power yields a high level security of message. Some popular attacks have 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. 

2020 Mathematical Sciences Classification: 26B25; 49N15. 

Keywords and Phrases: Conference matrix; Cryptography; Cipher attack; Hill ciphers