This article proposes a solution to the factorization problem in cryptographic systems by
leveraging the steps of the Toom‐Cook algorithm for large‐number multiplication. This …

Authentication and authorization techniques are essential for any kind of secure transaction
over the Internet. It enables and empowers mechanisms to implement highly secure systems …

Here we will present an iteration method for computing x and y in the equation x∗ a+ y∗ b=
gcd, where gcd is a greatest common divisor of preliminary known integer numbers a= 0 and …

In this note we will give one possible way of Euclidean algorithm realization using mainly”
subtraction” arithmetic operation, which leads to considerably faster results with respect to …

In the twenty-first century, the Internet has grown rapidly. Cryptography, with the protection of
number theory as an important guarantee for the Internet, is critical to study, and algorithms …