J. Kannan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
J. Kannan has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
A Deepshika
4 shared publicationsK Kaleeswari
4 shared publicationsK. Raja
Department of Mathematics, National College (Autonomous, affiliated to Bharathidasan University, Trichy), Trichy- 620001
4 shared publicationsM Mahalakshmi
4 shared publicationsManju Somanath
Department of Mathematics, National College (Autonomous, affiliated to Bharathidasan University, Trichy), Trichy- 620001
4 shared publications- M. Mahalakshmi
Ayya Nadar Janaki Ammal College (Autonomous, affiliated to Madurai Kamaraj University)
3 shared publications
Latest Publications
- 3 June 2025
- Published by Springer Nature
- p. 199-204
A Mobilization of p- Pellian Triangles with Area in ${\mathbb{Q}}$- 3 June 2025
- Published by Springer Nature
- p. 199-204
A Mobilization of p- Pellian Triangles with Area in ${\mathbb{Q}}$- 3 June 2025
- Published by Springer Nature
- p. 191-197
A Lead-In Study on Negative Peble Graphs
- 3 June 2025
- Published by Springer Nature
- p. 185-190
A Spearhead Instigation on Pseudo Peble Graphs
- Open Access
- 28 December 2024
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 17 (47) , 4959-4965
Cryptographical Applications of Linear Transformations and Pell Equations: An R-Based Approach
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
- 28 December 2024
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 17 (47) , 4959-4965
Open AccessCryptographical Applications of Linear Transformations and Pell Equations: An R-Based Approach
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
- Open Access
- 29 November 2024
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 17 (42) , 4449-4453
Computations of Exponential Diophantine Rectangles over Gnomonic Numbers using Python
Objective: The main objective of this paper is to define and collect a new type of rectangle called the Exponential Diophantine Rectangle over Gnomonic numbers (figurate numbers that take the form 𝑛2 − (𝑛 − 1)2, 𝑛 ∈ 𝑁). Methods: It is done by solving the two exponential Diophantine equations using Mihailescu’s theorem, binomial expansion, and the basic theory of congruences. Findings: Here, it is proven that there are only four exponential Diophantine rectangles over Gnomonic numbers. Finally, it is validated using Python programming for a specific limit. Novelty: The concept of solving an exponential Diophantine equation, as well as creating rectangles under certain conditions using Diophantine equations, is already known in mathematics. But in this article, we connect the shapes and Diophantine equation which is known as Exponential Diophantine rectangles over Gnomonic numbers. 2020 MSC Classification: 11A07, 11D61, 11D72. Keywords: Exponential Diophantine Equation; Exponential Diophantine Rectangles; Mihailescu’s Theorem; Gnomonic numbers; Rectangle; Exponential Diophantine Triangles
- 29 November 2024
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 17 (42) , 4449-4453
Open AccessComputations of Exponential Diophantine Rectangles over Gnomonic Numbers using Python
Objective: The main objective of this paper is to define and collect a new type of rectangle called the Exponential Diophantine Rectangle over Gnomonic numbers (figurate numbers that take the form 𝑛2 − (𝑛 − 1)2, 𝑛 ∈ 𝑁). Methods: It is done by solving the two exponential Diophantine equations using Mihailescu’s theorem, binomial expansion, and the basic theory of congruences. Findings: Here, it is proven that there are only four exponential Diophantine rectangles over Gnomonic numbers. Finally, it is validated using Python programming for a specific limit. Novelty: The concept of solving an exponential Diophantine equation, as well as creating rectangles under certain conditions using Diophantine equations, is already known in mathematics. But in this article, we connect the shapes and Diophantine equation which is known as Exponential Diophantine rectangles over Gnomonic numbers. 2020 MSC Classification: 11A07, 11D61, 11D72. Keywords: Exponential Diophantine Equation; Exponential Diophantine Rectangles; Mihailescu’s Theorem; Gnomonic numbers; Rectangle; Exponential Diophantine Triangles
- Open Access
- 29 November 2023
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 16 (44) , 4108-4113
2-Peble Triangles Over Figurate Numbers
Objectives: The main aim of this article is to discuss the existence or non-existence of -Peble triangles over some figurate numbers. Methods: A few quartic equations over integers are solved to complete the objective at hand. This is done with the aid of the transformation of variables. Additionally, fundamental concepts such as mathematical induction and parity of integers are used. Findings: Here, it is demonstrated that there are no 2-Peble triangles over triangular, hexagonal, and octagonal numbers. The same process is explained for particular special numbers as an exceptional instance. Novelty: This article defines a triangle, the d-Peble triangle over figurate numbers, which creates a link between the Pell equation and a common geometric shape. So many previous researchers, when examining a problem involving geometric shapes, attain their expected result using Diophantine equations. But this concept differs from those as this uses figurate numbers and a Pell equation to create a triangle. Keywords: 2-Peble Triangle, Figurate Numbers, Pell Equations, Exponential Diophantine Triangle, Quartic Equation
- 29 November 2023
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 16 (44) , 4108-4113
Open Access2-Peble Triangles Over Figurate Numbers
Objectives: The main aim of this article is to discuss the existence or non-existence of -Peble triangles over some figurate numbers. Methods: A few quartic equations over integers are solved to complete the objective at hand. This is done with the aid of the transformation of variables. Additionally, fundamental concepts such as mathematical induction and parity of integers are used. Findings: Here, it is demonstrated that there are no 2-Peble triangles over triangular, hexagonal, and octagonal numbers. The same process is explained for particular special numbers as an exceptional instance. Novelty: This article defines a triangle, the d-Peble triangle over figurate numbers, which creates a link between the Pell equation and a common geometric shape. So many previous researchers, when examining a problem involving geometric shapes, attain their expected result using Diophantine equations. But this concept differs from those as this uses figurate numbers and a Pell equation to create a triangle. Keywords: 2-Peble Triangle, Figurate Numbers, Pell Equations, Exponential Diophantine Triangle, Quartic Equation
- Open Access
- 12 November 2023
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 16 (41) , 3599-3604
Existence and Non - Existence of Exponential Diophantine Triangles Over Triangular Numbers
Objectives: The specified problem addressed here is the existence and non-existence of Exponential Diophantine triangles over triangular numbers ( ). Methods: An Exponential Diophantine triangle over triangular numbers is defined as a triangle with sides and where and are non - negative integers such that . To prove the existence of such triangles, negative Pell’s equation and its solutions are used along with some basic number theoretic concepts. To verify the non-existence, the well-known Catalan’s conjecture, binomial expansion, and various theories concerning congruence are employed. Findings: Here it is proved that, for five different choices of sides, an Exponential Diophantine triangle over can be constructed. In particular, infinitely many such triangles can be found. For some particular choice of sides, Python coding is displayed along with its output to verify the existence of required triangles. On the other side, another five different choices of sides are considered and it is shown that no considered type of triangles exists in these cases. Novelty: The idea of solving an exponential Diophantine equation and the idea of constructing triangles under some conditions using Diophantine equations already exists in the mathematical society. This article is created uniquely by combining these two concepts along with the innovative usage of exponential Diophantine equations. Keywords: Exponential Diophantine triangle, Exponential Diophantine Triangle over triangular numbers, Exponential Diophantine equation, Triangles, Triangular numbers
- 12 November 2023
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 16 (41) , 3599-3604
Open AccessExistence and Non - Existence of Exponential Diophantine Triangles Over Triangular Numbers
Objectives: The specified problem addressed here is the existence and non-existence of Exponential Diophantine triangles over triangular numbers ( ). Methods: An Exponential Diophantine triangle over triangular numbers is defined as a triangle with sides and where and are non - negative integers such that . To prove the existence of such triangles, negative Pell’s equation and its solutions are used along with some basic number theoretic concepts. To verify the non-existence, the well-known Catalan’s conjecture, binomial expansion, and various theories concerning congruence are employed. Findings: Here it is proved that, for five different choices of sides, an Exponential Diophantine triangle over can be constructed. In particular, infinitely many such triangles can be found. For some particular choice of sides, Python coding is displayed along with its output to verify the existence of required triangles. On the other side, another five different choices of sides are considered and it is shown that no considered type of triangles exists in these cases. Novelty: The idea of solving an exponential Diophantine equation and the idea of constructing triangles under some conditions using Diophantine equations already exists in the mathematical society. This article is created uniquely by combining these two concepts along with the innovative usage of exponential Diophantine equations. Keywords: Exponential Diophantine triangle, Exponential Diophantine Triangle over triangular numbers, Exponential Diophantine equation, Triangles, Triangular numbers
- 1 January 2023
- Published by Nova Science Publishers, Inc.
Fundamental Perceptions in Contemporary Number Theory
- 1 January 2023
- Published by Nova Science Publishers, Inc.
Fundamental Perceptions in Contemporary Number Theory
- Open Access
- 1 February 2022
- Published by Everant Journals in INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
- Vol. 10 (02) , 2555-2558
Remodeled RSA Algorithm for Messages of Length Two Employing G- Primes
Now - a- days, the exchange of sensitive information, such as credit card numbers, over the internet is common practice. Protecting data and electronic systems is crucial to our way of living. Cryptography deals with the study of communication over a channel may not be secure and problems related with them. One such well known algorithm is RSA algorithm. This paper displays the classical RSA algorithm and modifies the work in generation of keys. There will be two assignments for the alphabets. Here the only interest is on messages with two letters.
- 1 February 2022
- Published by Everant Journals in INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
- Vol. 10 (02) , 2555-2558
Open AccessRemodeled RSA Algorithm for Messages of Length Two Employing G- Primes
Now - a- days, the exchange of sensitive information, such as credit card numbers, over the internet is common practice. Protecting data and electronic systems is crucial to our way of living. Cryptography deals with the study of communication over a channel may not be secure and problems related with them. One such well known algorithm is RSA algorithm. This paper displays the classical RSA algorithm and modifies the work in generation of keys. There will be two assignments for the alphabets. Here the only interest is on messages with two letters.
- 5 October 2020
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2261 (1) , 030053
On a class of Gaussian integer solutions for an elliptic curve
The quadratic Diophantine equation with two unknown represented by an elliptic curve D : 76J2 + 649K2 – 436JK = 1600 is analyzed for its non-zero distinct solutions in Z[i]. We also derive some formulae and recurrence relations on the Gaussian integer solutions (Jn, Kn) of D.
- 5 October 2020
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2261 (1) , 030053
On a class of Gaussian integer solutions for an elliptic curve
The quadratic Diophantine equation with two unknown represented by an elliptic curve D : 76J2 + 649K2 – 436JK = 1600 is analyzed for its non-zero distinct solutions in Z[i]. We also derive some formulae and recurrence relations on the Gaussian integer solutions (Jn, Kn) of D.