Cryptography and Cryptanalysis in MATLAB: Creating and Programming Advanced Algorithms

© Marius Iulian Mihailescu and Stefania Loredana Nita 2021

M. I. Mihailescu, S. L. NitaCryptography and Cryptanalysis in MATLABhttps://doi.org/10.1007/978-1-4842-7334-0_4

4. Basic Arithmetic Foundations

Marius Iulian Mihailescu¹   and Stefania Loredana Nita¹

(1)

Bucharest, Romania

 

In cryptography, the Integer Factorization Problem (IFP) has significant importance because many cryptosystems with public keys ground their security on the hardness assumption of it. For example, RSA Laboratories launched many competitions that targeted IFPs [1]. The IFP problem consists of writing an arbitrary integer as a product of powers of prime numbers. Note that every integer number can be written as a product of prime numbers and that product is unique. At the same ...