On Construction of weighted orthogonal matrices over finite field and its application in cryptography
Shipra Kumari, Hrishikesh Mahato, Sumant Pushp

TL;DR
This paper introduces a method for constructing weighted orthogonal matrices over finite fields and demonstrates their application in cryptography, enhancing secure communication and key transmission.
Contribution
It presents a novel, easy method for constructing various orthogonal matrices over finite fields with practical cryptographic applications.
Findings
Constructed matrices facilitate secure key transmission
Method simplifies encryption and decryption processes
Enhances cryptographic security against intruders
Abstract
In this article, we propose a method to construct self orthogonal matrix, orthogonal matrix and anti orthogonal matrix over the finite field. Orthogonal matrices has numerous applications in cryptography, so here we demonstrate the application of weighted orthogonal matrix into cryptography. Using the proposed method of construction we see that it is very easy to transmit the private key and can easily convert the encrypted message into original message and at the same time it will be difficult to get the key matrix for intruder.
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography
