A heuristic search based factoring tool

  title={A heuristic search based factoring tool},
  author={C. Davis and C. Eick},
  journal={Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000},
  • C. Davis, C. Eick
  • Published 2000
  • Computer Science
  • Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000
Factoring is believed to be a difficult task. Although factoring is of interest in its own right, the security of RSA cryptography, among other cryptographic systems, is dependent on the difficulty of factoring the product of large primes. We show how to cast the problem of factoring integers as a state-based search to which the techniques of AI may be applied. Using small primes as operators, goal states can be characterized by integers close to a multiple kN of N, where N is the number to be… Expand
A Multithreaded Bound Varying Chaotic Firefly Algorithm for prime factorization
Observations show that the Firefly algorithm can be an effective tool to factorize a semi prime and hence can be further extended on extremely large numbers. Expand
Reconfigurable Hardware Implementation of the Lenstra Factorization Algorithm
This paper describes the main arithmetic building blocks needed for implementing the Lenstra factorization algorithm on a reconfigurable hardware platform for factorizing 32-bit composite numbers of the form n=pmiddotq, with p, q prime numbers. Expand
Optimization of distribution systems continuity indicators using immunological artificial algorithms
  • R. Araujo, M. Strauch, N. Kagan
  • Computer Science
  • 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America (T&D-LA)
  • 2010
The model proposed in this paper uses evolutionary computation techniques to solve the combinatorial explosion problem resulting from the possible areas combinations and minimization of penalties. Expand
Visualizing Spatial Partitions
We describe an application of geospatial visualization and AI search techniques to the problem of school redistricting, in which students are assigned to home schools within a county or schoolExpand
Simulation-based Optimization of Resource Placement and Emergency Response
A simulation-based optimization software called SOFER that learns from a history of emergency requests to optimize the placement of resources and response policies is described, which yields policies which perform better than the current practice, satisfy the usability constraints, and are sensitive to optimization metrics and population changes. Expand


Factoring integers with elliptic curves
This paper is devoted to the description and analysis of a new algorithm to factor positive integers that depends on the use of elliptic curves and it is conjectured that the algorithm determines a non-trivial divisor of a composite number n in expected time at most K( p)(log n)2. Expand
Prime numbers and computer methods for factorization
1. The Number of Primes Below a Given Limit.- What Is a Prime Number?.- The Fundamental Theorem of Arithmetic.- Which Numbers Are Primes? The Sieve of Eratosthenes.- General Remarks ConcerningExpand
The number field sieve
A heuristic run time analysis indicates that the number field sieve is asymptotically substantially faster than any other known factoring method, for the integers that it applies to, and can be modified to handle arbitrary integers. Expand
The Quadratic Sieve Factoring Algorithm
The quadratic sieve algorithm is currently the method of choice to factor very large composite numbers with no small factors, and some of the improvements suggested for it are described. Expand
Performance of Linear-Space Search Algorithms
The average-case performance of linear-space search algorithms, including depth-first branch-and-bound (DFBnB), iterative-deepening (ID), and recursive best-first search (RBFS) is studied, and analytic results are used to explain a surprising anomaly in the performance of these algorithms, and to predict the existence of a complexity transition in the Asymmetric Traveling Salesman Problem. Expand
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
  • R. Korf
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1985
This heuristic depth-first iterative-deepening algorithm is the only known algorithm that is capable of finding optimal solutions to randomly generated instances of the Fifteen Puzzle within practical resource limits. Expand
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys. Expand
Emperor: cheap legal secure cryptography for the Web
A cryptographic protocol heavily influenced by the Difie-Hellman and ElCamal protocols is proposed which has the virtue of allowing secure communication with no previous key distribution, no random number generation on the browser side and no violation of the laws protecting intellectual property. Expand
Elementary Number Theory
Some preliminary considerations divisibility theory in the integers primes and their distribution the theory of congruences Fermat's theorem number-theoretic functions Euler's generalization ofExpand
Districting principles and democratic representation
Redistricting is always political, increasingly controversial, and often ugly. Politicians have always fought tooth-and-nail over district lines, while the courts, for most of their history,Expand