@article{Pieprzyk_2019,
author = {Pieprzyk, Josef},
title = {Integer Factorization – Cryptology Meets Number Theory},
journal = {Scientific Journal of Gdynia Maritime University},
number = {109,
pages = {7-20},
year = {2019},
url = {http://zeszyty.am.gdynia.pl/artykul-2680.html},
Integer factorization is one of the oldest mathematical problems. Initially, the interest in factorization was motivated by curiosity about behaviour of prime numbers, which are the basic building blocks of all other integers. Early factorization algorithms were not very efficient. However, this dramatically has changed after the invention of the well-known RSA public-key cryptosystem. The reason for this was simple. Finding an efficient factoring algorithm is equivalent to breaking RSA.
The work overviews development of integer factoring algorithms. It starts from the classical sieve of Eratosthenes, covers the Fermat algorithm and explains the quadratic sieve, which is a good representative of modern factoring algorithms. The progress in factoring is illustrated by examples of RSA challenge moduli, which have been factorized by groups of mathematicians and cryptographers. Shor's quantum factorization algorithm with polynomial complexity is described and the impact on public-key encryption is discussed.
},
e-issn={2541-2486},
publisher = {Gdynia Maritime University},
keywords = {
Cryptography, Number Theory, Public-key Cryptography, Factorization, RSA Cryptosystems, Quantum Computing, Shor Algorithm},
doi = {https://www.doi.org/10.26408/109.01}
}