Cryptographical Applications of Linear Transformations and Pell Equations: An R-Based Approach

• Published in: Indian journal of science and technology Vol. 17; no. 47; pp. 4959 - 4965
• Main Authors: Kaleeswari, K, Kannan, J, Deepshika, A, Mahalakshmi, M
• Format: Journal Article
• Language: English
• Published: 28.12.2024
• DOI: 10.17485/IJST/v17i47.3714
• ISSN: 0974-6846

Objective: This article’s main aim is to encrypt and decrypt the message to be sent using matrices of the linear transformation and the fundamental solution of the Pell equation. R Programming is provided at the end of the article. Methods: The encryption and decryption algorithms were created using the fundamental solutions of the Pell equation 2 − 2 = 1, where p is a positive integer which is not a perfect square, and using the matrices of the linear transformations. The message to be sent is converted into block matrices of order 2. Based on the number of blocks, the prime is determined. Findings: Here, we gave two examples: manually for the sentence ”MATHS IS A UNIVERSAL SUBJECT” and using R programming for the word ”PIE.” Novelty: The concept of encrypting and decrypting a message or word already exists. Many algorithms have been created in different ways. But, in this article, we created the algorithms connecting the matrix of linear transformations and the fundamental solution of Pell equations. 2020 MSC Classification: 94A60, 15A04, 11C20. Keywords: Cryptography; Linear transformation; Pell equation; Encryption; Decryption