Cryptography Using Linear Diophantine Equation
Mark Kenneth C. Engcot · Zenodo (CERN European Organization for Nuclear Research) · 2022
Abstract: This study is focused on the encrypting and decrypting of messages using the Linear Diophantine Equation: where , that is the integers and are relatively prime. Like any encrypting and decrypting process, a number code, the integers and , and the flow of the process must be known to both the messenger and the receiver of the message. In this particular study, the message is encrypted by using the number code that results when the values of and are solved from the equations: and , where and is a particular solution of the Linear Diophantine Equation ( where ). The values of and are solved by substituting with the specific number code assigned to each letter in the message. Since the encrypted message is dependent on the coding agreed both by the messenger and the receiver, the receiver is able to decrypt the message by finding the value of and use the corresponding number code, and the schematic diagram. Keywords: cryptography, linear Diophantine equation, encrypt, decrypt, encode, decode. Title: Cryptography Using Linear Diophantine Equation Author: Mark Kenneth C. Engcot International Journal of Recent Research in Mathematics Computer Science and Information Technology ISSN 2350-1022 Vol. 9, Issue 1, April 2022 - September 2022 Page No: 28-33 Paper Publications Website: www.paperpublications.org Published Date: 08-August-2022 DOI: https://doi.org/10.5281/zenodo.6974146 Paper Download Link (Source) https://www.paperpublications.org/upload/book/Cryptography%20Using%20Linear%20Diophantine-08082022-3.pdf