Fermat's Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus
N using exhaustive search. The appearance of the Estimated Prime Factor (EPF) method …

A cryptography system was developed previously based on Cipher Polygraphic Polyfunction
transformations, C i× j (t)≡ A i× it P i× jmod N where C i× j, P i× j, A i× i are cipher text, plain …

This paper explores the security claims of the Generalized (Rivest-Shamir-Adleman)-
Advance and Adaptable Cryptosystem, in short the GRSA-AA cryptosystem. In the GRSA-AA …

A New Improved Bound for Short Decryption Exponent on RSA Modulus N = pq using
Wiener’s Method Page 1 Malaysian Journal of Mathematical Sciences 13(S) April: 89–99 (2019) …

This paper presents a new factoring technique on the modulus, where and are large prime
numbers. Suppose there exists an integer satisfies the equation, for some unknown integer …

To confirm applicability of a modified Baptista symmetric cryptosystem that is based on the
chaotic dynamical system, the CFEA compression algorithm was used. Various ciphers that …

The idea to utilize key e to encrypt and key d to decrypt came from the seminal work by Diffie
and Hellman, 1976 where e= d. This idea radicalized the secure communication concept …