Skip to search formSkip to main contentSkip to account menu

Trial division

Known as: Trial divisor, Trial factoring 
Trial division is the most laborious but easiest to understand of the integer factorization algorithms. The essential idea behind trial division… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Baillie–PSW primality testContext of computational complexityGeneral number field sieveGenerating primes

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr… 
2013
2013
Reforming the Immigration Courts of the United States: Why is There No Will to Make It an Article I Court?
This article strongly reaffirms the author's support for the use of asylum as a way of providing justice for those fleeing… 
Review
2010
Review
2010
The International Criminal Court’s Exercise of Jurisdiction Over the Crime of Aggression – At Last ... In Reach ... Over Some
The first review conference to the Rome Statute of the International Criminal Court, held in June 2010 in Kampala successfully… 
2009
2009
Comparative Strength of Common Structural Shapes Using Genetic Algorithms
The motivation for this paper is to develop an approach to optimization of beam design. Under given loading and support… 
2009
2009
Comparison of Road Pavement Performance Modeling of India and Hungary
The pace of growth of road infrastructure in India and Hungary is not commensurate with the traffic. As a result, the highway… 
2007
2007
Output-sensitive modular algorithms for polynomial matrix normal forms
2007
2007
An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
We present a polynomial time algorithm for the following problem: to check whether a lacunary polynomial f(x) vanishes at a given… 
Highly Cited
1999
Highly Cited
1999
Experimenting with Shared Generation of RSA Keys
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA… 
Highly Cited
1993
Highly Cited
1993
High-radix modular multiplication for cryptosystems
  • Peter Kornerup
  • Proceedings of IEEE 11th Symposium on Computer…
  • 1993
  • Corpus ID: 5859414
Two algorithms for modular multiplication with very large moduli are analyzed specifically for their applicability when a high… 
1957
1957
New Developments in Chemical Brush Control in Arkansas.
Eradication and control of noxious brush on rangelands, pasturelands, and woodlands offer excellent opportunities for improved… 
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)