This project implements both the Euclidean Algorithm to compute the Greatest Common Divisor (GCD) of two integers and the Extended Euclidean Algorithm, which finds integer coefficients for Bézout's ...

Abstract: Modular arithmetic is becoming an area of major importance for many modern applications; RNS is widely used in digital signal processing, and most public-key cryptographic algorithms require ...

Abstract: With the explosive growth in data communications and internet services, public key cryptography such as RSA is crucial for information privacy and security. As an important research topic, ...

Authenticated stream cipher based on SHA-3/Keccak sponge Cryptographically secure pseudo random number generator also based on SHA-3/Keccak sponge Arbitrarily large signed integer arithmetic (very big ...