Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm

QR Code

Determination of a good indicator for estimated prime factor and its modification in Fermat’s Factoring Algorithm

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 reduces the cost of FFA’s loop count. However, the EPF does not work for balanced primes. This paper proposed the modified...

Full description

Bibliographic Details
Main Authors:	Mohd Tahir, Rasyid Redha, Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal, Mahad, Zahari
Format:	Article
Language:	English
Published:	Multidisciplinary Digital Publishing Institute 2021
Online Access:	http://psasir.upm.edu.my/id/eprint/96655/ http://psasir.upm.edu.my/id/eprint/96655/1/ABSTRACT.pdf

Similar Items

The Blömer-May’s weak key revisited
by: Mohd Tahir, Rasyid Redha, et al.
Published: (2019)

A new attack on special-structured RSA primes
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2019)

New attacks on prime power N = prq using good approximation of φ(N)
by: Shehu, Sadiq, et al.
Published: (2017)

A new LSB attack on special-structured RSA primes
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2020)

New directions in factoring the prime power RSA modulus N = prq
by: Shehu, Sadiq, et al.
Published: (2016)

A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2013)

Efficient methods to overcome Rabin cryptosystem decryption failure
by: Mahad, Zahari, et al.
Published: (2017)

Analysis on the Rabin-p cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Design and analysis of Rabin-p key encapsulation mechanism for CyberSecurity Malaysia MySEAL initiative
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

Enhanced AAβ cryptosystem - a comparative analysis
by: Mahad, Zahari, et al.
Published: (2019)

Enhanced AAβ cryptosystem: the design
by: Asbullah, Muhammad Asyraf, et al.
Published: (2018)

Constructing the prime orbit theorem for the beta transformation
by: Kamel Ariffin, Muhammad Rezal
Published: (2009)

New cryptanalytic attack on RSA modulus N = pq using small prime difference method
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2019)

Extending Pollard class of factorable RSA modulus
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2018)

Fermat's principle for seismic rays in elastic media
by: Bona, Andrej, et al.
Published: (2003)

Cryptanalysis on prime power RSA modulus of the form N=prq
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2016)

New vulnerability on system of Ni = p²iqi using good approximation of Φ(N)
by: Nek Abd Rahman, Normahirah, et al.
Published: (2018)

AAβ public key cryptosystem - a new practical asymmetric implementation based on the square root problem
by: Mahad, Zahari, et al.
Published: (2012)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015)

AAβ public-key cryptosystem - a practical implementation of the new asymmetric
by: Mahad, Zahari, et al.
Published: (2013)

AAβ public key cryptosystem - a comparative analysis against RSA and ECC
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2012)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014)

A new efficient Rabin-like signature scheme
by: Mahad, Zahari, et al.
Published: (2016)

Security Analysis of a Public Key Cryptosystem for Synchronized Chaotic Systems
by: Mahad, Zahari, et al.
Published: (2022)

Provably secure Rabin-p cryptosystem in hybrid setting
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Fast decryption method for a Rabin primitive-based cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

New attacks on RSA with modulus N = p2q using continued fractions
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

A proposed CCA-secure encryption on an ElGamal variant
by: Asbullah, Muhammad Asyraf, et al.
Published: (2012)

Provably secure randomized AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

Design of Rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2013)

Algebraic cryptanalysis on the AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Algebraic analysis of a rabin-like cryptosystem and its countermeasures
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Another proof of wiener's short secret exponent
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

Analysis on the AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

An attack on N = p2q with partially known bits on the multiple of the prime factors
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2021)

Nonsmooth algorithms and Nesterov’s smoothing technique for generalized Fermat–Torricelli problems
by: Nam, N.M., et al.
Published: (2014)

Concurrent factorization of RSA moduli via weak key equations
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2024)

On (unknowingly) using near-square RSA primes
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2022)