Skip to search formSkip to main contentSkip to account menu

Integer factorization

Known as: Factoring integers, Prime factorization algorithm, Prime decomposition 
In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers. If these integers are further… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
zero coupling strength is measured at We find a typical next-nearest neighbour coupling of g/ 2 π = 1 . 3 MHz, consistent with… 
Highly Cited
2006
Highly Cited
2006
Attacks on Hash Functions.- Finding SHA-1 Characteristics: General Results and Applications.- Improved Collision Search for SHA-0… 
Review
2005
Review
2005
ContextL is an extension to the Common Lisp Object System that allows for Context-oriented Programming. It provides means to… 
Highly Cited
2000
Highly Cited
2000
In this paper we consider quantum interactive proof systems, which are interactive proof systems in which the prover and verifier… 
Highly Cited
1996
Highly Cited
1996
We show that computing the most significant bits of the secret key in a Diffie-Hellman key-exchange protocol from the public keys… 
Highly Cited
1991
Highly Cited
1991
Three new trapdoor one-way functions are proposed that are based on elliptic curves over the ring Zn. The first class of… 
Highly Cited
1990
Highly Cited
1990
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear… 
Highly Cited
1981
Highly Cited
1971
Highly Cited
1971
A digital frequency synthesizer has been designed and constructed based on generating digital samples of \exp [j(2^{\pi}nk/N)] at…