Skip to search formSkip to main contentSkip to account menu

Fermat's factorization method

Known as: Fermat factorisation, Fermat factorization method, Fermat's method 
Fermat's factorization method, named after Pierre de Fermat, is based on the representation of an odd integer as the difference of two squares: That… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Congruence of squaresDixon's factorization methodFactor theoremFactorization of polynomials

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Fermat Factorization using a Multi-Core System
Factoring a composite odd integer into its prime factors is one of the security problems for some public-key cryptosystems such… 
2016
2016
Improving fermat factorization algorithm by dividing modulus into three forms
Integer Factorization (IF) becomes an important issue since RSA which is the public key cryptosystem was occurred, because IF is… 
2015
2015
New Factoring Algorithm: Prime Factoring Algorithm
Network security is to protect the system to the unauthorized access or threads. The threads which are viruses, Trojan horses… 
2014
2014
A new modified integer factorization algorithm using integer modulo 20's technique
The aim of this paper is to propose a new modified integer factorization algorithm, is called Modified Fermat Factorization… 
2013
2013
MFFV2 and MNQSV2: Improved Factorization Algorithms
We propose a method to decrease processing time for two factorization algorithms. One is Modified Fermat Factorization Version 2… 
2012
2012
Notice of Violation of IEEE Publication PrinciplesModified Integer Factorization Algorithm Using V-Factor Method
RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring… 
Review
2011
Review
2011
Are Your Credit Cards Safe From Me
I will begin with a brief overview of the history of cryptography and then specifically look at RSA cryptography. RSA is used for… 
2011
2011
An Efficient Method to Factorize the RSA Public Key Encryption
The security of public key encryption such as RSA scheme relied on the integer factoring problem. The security of RSA algorithm… 
2004
2004
Fermat and the Quadrature of the Folium of Descartes
(2004). Fermat and the Quadrature of the Folium of Descartes. The American Mathematical Monthly: Vol. 111, No. 3, pp. 216-229. 
1993
1993
The integer square root of N via a binary search
An algorithm is presented which may be used to find the integer square root of N. The method is intended for use on a binary… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)