Encryption and Decryption Technique Involving Finite Fields
Ayush Mittal1, Ravindra Gupta2
1Ayush Mittal, Student, Department of Computer Science Engineering, SRK University, Bhopal, India.
2Ravindra Kumar Gupta, Associate Professor, Computer Science Engineering, SRK University, Bhopal, India.
Manuscript received on November 15, 2019. | Revised Manuscript received on November 23, 2019. | Manuscript published on November 30, 2019. | PP: 2475-2478 | Volume-8 Issue-4, November 2019. | Retrieval Number: D6953118419/2019©BEIESP | DOI: 10.35940/ijrte.D6953.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The object of this paper is to produce a technique for encryption and decryption Involving Finite Fields. In this paper we consider the elements of finite fields GF(2m) and logical operator XOR to analyze the encryption and decryption technique. Here we also uses the non-singular matrix and a key matrix.
Keywords: Finite Fields, Logical Operator XOR, Encryption, Decryption.
Scope of the Article: Artificial Intelligent Methods, Models, Techniques.