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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
010020019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4… (More)
Is this relevant?
2009
2009
Integer factorization is a very hard computational problem. Currently no e cient algorithm for integer factorization is publicly… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • By H. W. LENSTRA
  • 2005
This paper is devoted to the description and analysis of a new algorithm to factor positive integers. It depends on the use of… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Invertible wavelet transforms that map integers to integers have important applications in lossless coding. In this paper we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Vanstone and Zuccherato [3] propose a cryptographic system based on an elliptic curve modulo a composite number N = pq, whose… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate… (More)
  • table 3.1
  • table 3.2
  • figure 5.1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Invertible wavelet transforms that map integers to integers are important for lossless representations. In this paper, we present… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Lenstra’s integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the… (More)
  • table 1
Is this relevant?