 |
Computing Aurifeuillian factors
Computing Aurifeuillian factors: Algorithm that finds non-trivial factors of certain numbers of the form a^b +/- 1. (Factoring)
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pub127.html |
 |
Fermat Search
Fermat Search: Leonid Durman's Fermat number factoring site and program. (Factoring)
http://www.fermatsearch.org/ |
 |
Number Field Sieve
Number Field Sieve: Triade systems links to papers on the number field sieve. (Factoring)
http://triade.studentenweb.org/Nfs/nfs.html |
 |
FactorWorld
FactorWorld: Dedicated to algorithms and computational results on integer factorization. Includes links to papers, downloadable software, and online resources. (Factoring)
http://www.crypto-world.com/FactorWorld.html |
 |
Factoring Fermat Numbers
Factoring Fermat Numbers: Cash prizes for new factors of Fermat numbers Fn, for n = 12 through 22. (Factoring)
http://www.perfsci.com/freegoods.htm#fermat |
 |
Sierpinski Problem
Sierpinski Problem: Sierpinski proved there exist infinitely many odd integers k such that k*2^n+1 is composite for every n. Ray Ballinger coordinates a search to prove or disprove whether k=78557 is the smallest solution. (Factoring)
http://www.prothsearch.net/sierp.html |
 |
Factoris
Factoris: Online calculator that factorizes large numbers, specified by formula. (Factoring)
http://wims.unice.fr/~wims/wims.cgi?lang=en&module=tool/algebra/factor.en&cmd=new& |
 |
Known Amicable Pairs
Known Amicable Pairs: A listing of all the known pairs of numbers, each of which is the sum of the aliquot divisors of the other. Complete for smaller numbers, and extending beyond 200 digits. (Factoring)
http://amicable.homepage.dk/knwnap.htm |
 |
Factorization Using the Elliptic Curve Method
Factorization Using the Elliptic Curve Method: Java applet that can be used to find 20- or 30-digit factors of numbers or numerical expressions up to 1000 digits long. It also computes the number and sum of divisors, the Euler's totient and moebius functions, and the decomposition of the number in a s (Factoring)
http://www.alpertron.com.ar/ECM.HTM |
 |
Factoring Papers
Factoring Papers: Links to papers on the theory and practice of factoring. (Factoring)
http://www.crypto-world.com/FactorPapers.html |
 |
The Factor Zone
The Factor Zone: Aimed at grade school students and teachers, includes course guidelines, worksheets, and factor tables up to 600. (Factoring)
http://factorzone.tripod.com/ |
 |
Robinson Primes
Robinson Primes: An analysis of problems relating to the numbers k.2^n+-1, primes, and factor patterns, including the Sierpinski problem. (Factoring)
http://www.glasgowg43.freeserve.co.uk/robintro.htm |
 |
Factorization of F10
Factorization of F10: F10 = 2^(2^10) + 1 is the 10-th Fermat number. Richard Brent describes his discovery of the two largest factors. (Factoring)
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/F10.html |
 |
Discovery of a Lost Factoring Machine
Discovery of a Lost Factoring Machine: Built by a French amateur, E.-O. Carissan, around 1919. Shallit, Williams and Morain include photographs and references to their paper. (Factoring)
http://www.cs.uwaterloo.ca/~shallit/Papers/carissan.html |
 |
Factorization of RSA-155
Factorization of RSA-155: Announcement of factorization of a 512-bit RSA key using the General Number Field Sieve (GNFS). (Factoring)
http://www.crypto-world.com/announcements/RSA155.txt |
 |
The Anti-Divisor
The Anti-Divisor: A definition and description of the Anti-Divisor, and some related results. (Factoring)
http://www.users.globalnet.co.uk/~perry/maths |
 |
N!+-1 Factoring Status
N!+-1 Factoring Status: Factoring efforts that have been made so far on numbers of the form n!+-1 using ECM factoring. (Factoring)
http://www.uow.edu.au/~ajw01/ecm/curves.html |
 |
Integer Factorization
Integer Factorization: Paul Leyland's list of his own and other factorisations. (Factoring)
http://www.leyland.vispa.com/numth/factorization/main.htm |
 |
I Love Binary, Primes, and Factors
I Love Binary, Primes, and Factors: Divisibility, primes and binary numbers. (Factoring)
http://home.earthlink.net:80/~usondermann/binary.html |
 |
The XYYXF Project
The XYYXF Project: A collaborative project to produce the factorizations of x^y + y^x for 1<y<x<101. (Factoring)
http://xyyxf.at.tut.by/ |
 |
Sam Wagstaff
Sam Wagstaff: Article about SNFS factorisation of 3^349-1. (Factoring)
http://www.purdue.edu/UNS/html4ever/9705.Wagstaff.number.html |
 |
Paul Herman's Factoring Page
Paul Herman's Factoring Page: A thorough summary of many major factoring methods. Includes some source code on many pages, gentle introductions to the more complex methods and further links. (Factoring)
http://www.frenchfries.net/paul/factoring/ |
 |
RSA Laboratories Factoring Challenge
RSA Laboratories Factoring Challenge: Numbers representative of those used in the RSA cryptosystem are offered for factor attempts with prizes. A Partition List challenge is also provided in order to encourage work on factoring in general. (Factoring)
http://www.rsasecurity.com/rsalabs/node.asp?id=2092 |
 |
Factorizations of Near-repdigit Numbers
Factorizations of Near-repdigit Numbers: Factorizations of numbers composed of all the same digit except first and/or last. (Factoring)
http://homepage2.nifty.com/m_kamada/math/factorizations.htm |