The use of Fermat’s Little Theorem and its analogues in cryptography
Received: 05 Oct 2026 Revised: 17 Oct 2026 Accepted: 28 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 270–273
Abstract
In this article, we will examine an important cryptographic problem: constructing efficient primality tests used to generate large prime numbers. We improve upon existing methods by using analogues of Fermat’s little theorem.
Keywords: primality test, finite fields, factorization, cryptographic protocols, elliptic curves, Lucas method, Williams’ method.
BibTeX
@article{IS-Ishmukhametov-Kurbangaleev-Mubarakov-Rubtsova2026,
author = {Ishmukhametov, Shamil Talgatovich and Kurbangaleev, Artur Askarovich and Mubarakov, Bulat Gazinurovich and Rubtsova, Ramilya Gakilevna},
title = {{The use of Fermat’s Little Theorem and its analogues in cryptography}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {270--273},
}
AMSBIB
\Bibitem{IS-Ishmukhametov-Kurbangaleev-Mubarakov-Rubtsova2026}
\by S.\,T.~Ishmukhametov, A.\,A.~Kurbangaleev, B.\,G.~Mubarakov, R.\,G.~Rubtsova
\paper The use of Fermat’s Little Theorem and its analogues in cryptography
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 270--273
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU