<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (FactInt) - Contents</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
</head>
<body>
<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
<div class="chlinkprevnexttop"> <a href="chap0.html">Top of Book</a> <a href="chap1.html">Next Chapter</a> </div>
<p><a id="X7D2C85EC87DD46E5" name="X7D2C85EC87DD46E5"></a></p>
<div class="pcenter">
<h1><strong class="pkg">FactInt</strong></h1>
<h2>Advanced Methods for Factoring Integers</h2>
<p>
Version 1.5.2</p>
<p>September 26, 2007</p>
</div>
<p><b>
Stefan Kohl
</b>
<br />e-mail: <span class="URL"><a href="mailto:kohl@mathematik.uni-stuttgart.de">kohl@mathematik.uni-stuttgart.de</a></span>
<br />WWW: <span class="URL"><a href=" http://www.cip.mathematik.uni-stuttgart.de/~kohlsn/ "> http://www.cip.mathematik.uni-stuttgart.de/~kohlsn/ </a></span>
<br />Address: <br />Institut für Geometrie und Topologie <br /> Pfaffenwaldring 57 <br /> Universität Stuttgart <br /> 70550 Stuttgart <br /> Germany
</p>
<p><a id="X7AA6C5737B711C89" name="X7AA6C5737B711C89"></a></p>
<h3>Abstract</h3>
<p>This package for <strong class="pkg">GAP</strong> 4 provides a general-purpose integer factorization routine, which makes use of a combination of factoring methods. In particular it contains implementations of the following algorithms:</p>
<ul>
<li><p>Pollard's p-1</p>
</li>
<li><p>Williams' p+1</p>
</li>
<li><p>Elliptic Curves Method (ECM)</p>
</li>
<li><p>Continued Fraction Algorithm (CFRAC)</p>
</li>
<li><p>Multiple Polynomial Quadratic Sieve (MPQS)</p>
</li>
</ul>
<p>It also contains code by Frank Lübeck for making use of Richard P. Brent's tables of factors of integers of the form b^k pm 1. <strong class="pkg">FactInt</strong> is completely written in the <strong class="pkg">GAP</strong> language and contains / requires no external binaries. It needs <strong class="pkg">GAPDoc</strong> 1.0 <a href="chapBib.html#biBGAPDoc">[LN07]</a> or higher. <strong class="pkg">FactInt</strong> must be installed in the <code class="file">pkg</code> subdirectory of the <strong class="pkg">GAP</strong> distribution.</p>
<p><a id="X81488B807F2A1CF1" name="X81488B807F2A1CF1"></a></p>
<h3>Copyright</h3>
<p>© 1999 - 2007 by Stefan Kohl. This package is distributed under the GNU General Public License.</p>
<p><a id="X82A988D47DFAFCFA" name="X82A988D47DFAFCFA"></a></p>
<h3>Acknowledgements</h3>
<p>I would like to thank Bettina Eick and Steve Linton for their support and many interesting discussions.</p>
<p><a id="X8537FEB07AF2BEC8" name="X8537FEB07AF2BEC8"></a></p>
<div class="contents">
<h3>Contents</h3>
<div class="ContChap"><a href="chap1.html#X874E1D45845007FE">1. <span class="Heading">Preface</span></a>
</div>
<div class="ContChap"><a href="chap2.html#X7B1A84BB788FC526">2. <span class="Heading">The General Factorization Routine</span></a>
<div class="ContSect"><span class="nocss"> </span><a href="chap2.html#X83BF2CD28017ABC5">2.1 <span class="Heading">The method for <code class="code">Factors</code></span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap2.html#X833B087D7A83BC7A">2.1-1 Factors</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap2.html#X866CD23D78460060">2.1-2 FactInt</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap2.html#X83A95F837BB78098">2.2 <span class="Heading">Getting information about the factoring process</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap2.html#X8093BB787C2E764B">2.2-1 InfoFactInt</a></span>
</div>
</div>
<div class="ContChap"><a href="chap3.html#X7E7EE1A1785A8009">3. <span class="Heading">The Routines for Specific Factorization Methods</span></a>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X7A0392177E697956">3.1 <span class="Heading">Trial division</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7C4D255A789F54B4">3.1-1 FactorsTD</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X8081FF657DA9C674">3.2 <span class="Heading">Pollard's p-1</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7AF95E2E87F58200">3.2-1 FactorsPminus1</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X860B4BE37DABDE10">3.3 <span class="Heading">Williams' p+1</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X8079A0367DE4FC35">3.3-1 FactorsPplus1</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X855CB8B07A0141C4">3.4 <span class="Heading">The Elliptic Curves Method (ECM)</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X87B162F878AD031C">3.4-1 FactorsECM</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X78466BB97BEE5495">3.5 <span class="Heading">The Continued Fraction Algorithm (CFRAC)</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7A5C8BC5861CFC8C">3.5-1 FactorsCFRAC</a></span>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap3.html#X81A47111807C58B1">3.6 <span class="Heading">The Multiple Polynomial Quadratic Sieve (MPQS)</span></a>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X86F8DFB681442E05">3.6-1 FactorsMPQS</a></span>
</div>
</div>
<div class="ContChap"><a href="chap4.html#X85B6B6E4796B99EE">4. <span class="Heading">How much Time does a Factorization take?</span></a>
<div class="ContSect"><span class="nocss"> </span><a href="chap4.html#X825FC33479FE2B1D">4.1 <span class="Heading">Timings for the general factorization routine</span></a>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap4.html#X8131C8BD7F637545">4.2 <span class="Heading">Timings for the ECM</span></a>
</div>
<div class="ContSect"><span class="nocss"> </span><a href="chap4.html#X7E2D09BD7AD0D77F">4.3 <span class="Heading">Timings for the MPQS</span></a>
</div>
</div>
<br />
</div>
<div class="chlinkprevnextbot"> <a href="chap0.html">Top of Book</a> <a href="chap1.html">Next Chapter</a> </div>
<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
<hr />
<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
91213ddcfbe7f54821d42c2d9e091326
>
files
>
998
