  
  [1X3 The Routines for Specific Factorization Methods[0X
  
  Descriptions  of  the  factoring  methods implemented in this package can be
  found in [Bre89] and [Coh93]. Cohen's book contains also descriptions of the
  other methods mentioned in the preface.
  
  
  [1X3.1 Trial division[0X
  
  [1X3.1-1 FactorsTD[0m
  
  [2X> FactorsTD( [0X[3Xn[, Divisors][0X[2X ) _______________________________________[0Xfunction
  [6XReturns:[0X  A  list  of  two  lists: The first list contains the prime factors
            found,  and the second list contains remaining unfactored parts of
            [3Xn[0m, if there are any.
  
  This  function  tries  to  factor [3Xn[0m by trial division. The optional argument
  [3XDivisors[0m  is  the  list  of trial divisors. If not given, it defaults to the
  list of primes p < 1000.
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsTD(12^25+25^12);[0X
    [4X[ [ 13, 19, 727 ], [ 5312510324723614735153 ] ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
  
  [1X3.2 Pollard's p-1[0X
  
  [1X3.2-1 FactorsPminus1[0m
  
  [2X> FactorsPminus1( [0X[3Xn[[, a], Limit1[, Limit2]][0X[2X ) _____________________[0Xfunction
  [6XReturns:[0X  A  list  of  two  lists: The first list contains the prime factors
            found,  and the second list contains remaining unfactored parts of
            [3Xn[0m, if there are any.
  
  This  function  tries to factor [3Xn[0m using Pollard's p-1. It uses [3Xa[0m as base for
  exponentiation,  [3XLimit1[0m  as  first  stage  limit  and [3XLimit2[0m as second stage
  limit.  If  the function is called with three arguments, these arguments are
  interpreted  as  [3Xn[0m, [3XLimit1[0m and [3XLimit2[0m. Defaults are chosen for all arguments
  which are omitted.
  
  Pollard's  p-1  is based on the fact that exponentiation (mod n) can be done
  efficiently  enough  to  compute  a^k!  mod n  for sufficiently large k in a
  reasonable  amount  of time. Assume that p is a prime factor of n which does
  not  divide a,  and  that  k!  is a multiple of p-1. Then Lagrange's Theorem
  states  that  a^k!  =  1 (mod p). If k! is not a multiple of q-1 for another
  prime  factor  q  of n,  it is likely that the factor p can be determined by
  computing  gcd(a^k!-1,n).  A  prime factor p is usually found if the largest
  prime factor of p-1 is not larger than [3XLimit2[0m, and the second-largest one is
  not  larger  than [3XLimit1[0m. (Compare with [2XFactorsPplus1[0m ([14X3.3-1[0m) and [2XFactorsECM[0m
  ([14X3.4-1[0m).)
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsPminus1( Factorial(158) + 1, 100000, 1000000 );[0X
    [4X[ [ 2879, 5227, 1452486383317, 9561906969931, 18331561438319, [0X
    [4X      4837142997094837608115811103417329505064932181226548534006749213\[0X
    [4X4508231090637045229565481657130504121732305287984292482612133314325471\[0X
    [4X3674832962773107806789945715570386038565256719614524924705165110048148\[0X
    [4X7161609649806290811760570095669 ], [  ] ][0X
    [4Xgap> List( last[ 1 ]{[ 3, 4, 5 ]}, p -> Factors( p - 1 ) );[0X
    [4X[ [ 2, 2, 3, 3, 81937, 492413 ], [ 2, 3, 3, 3, 5, 7, 7, 1481, 488011 ][0X
    [4X    , [ 2, 3001, 7643, 399613 ] ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
  
  [1X3.3 Williams' p+1[0X
  
  [1X3.3-1 FactorsPplus1[0m
  
  [2X> FactorsPplus1( [0X[3Xn[[, Residues], Limit1[, Limit2]][0X[2X ) _______________[0Xfunction
  [6XReturns:[0X  A  list  of  two  lists: The first list contains the prime factors
            found,  and the second list contains remaining unfactored parts of
            [3Xn[0m, if there are any.
  
  This  function  tries  to  factor  [3Xn[0m  using Williams' p+1. It tries [3XResidues[0m
  different  residues,  and  uses  [3XLimit1[0m  as  first stage limit and [3XLimit2[0m as
  second  stage  limit.  If the function is called with three arguments, these
  arguments  are  interpreted as [3Xn[0m, [3XLimit1[0m and [3XLimit2[0m. Defaults are chosen for
  all arguments which are omitted.
  
  Williams' p+1 is very similar to Pollard's p-1 (see [2XFactorsPminus1[0m ([14X3.2-1[0m)).
  The  difference  is that the underlying group here can either have order p+1
  or  p-1,  and  that the group operation takes more time. A prime factor p is
  usually  found  if  the  largest  prime factor of the group order is at most
  [3XLimit2[0m  and  the second-largest one is not larger than [3XLimit1[0m. (Compare also
  with [2XFactorsECM[0m ([14X3.4-1[0m).)
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsPplus1( Factorial(55) - 1, 10, 10000, 100000 );[0X
    [4X[ [ 73, 39619, 277914269, 148257413069 ], [0X
    [4X  [ 106543529120049954955085076634537262459718863957 ] ][0X
    [4Xgap> List( last[ 1 ], p -> [ Factors( p - 1 ), Factors( p + 1 ) ] );[0X
    [4X[ [ [ 2, 2, 2, 3, 3 ], [ 2, 37 ] ], [0X
    [4X  [ [ 2, 3, 3, 31, 71 ], [ 2, 2, 5, 7, 283 ] ], [0X
    [4X  [ [ 2, 2, 2207, 31481 ], [ 2, 3, 5, 9263809 ] ], [0X
    [4X  [ [ 2, 2, 47, 788603261 ], [ 2, 3, 5, 13, 37, 67, 89, 1723 ] ] ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
  
  [1X3.4 The Elliptic Curves Method (ECM)[0X
  
  [1X3.4-1 FactorsECM[0m
  
  [2X> FactorsECM( [0X[3Xn[, Curves[, Limit1[, Limit2[, Delta]]]][0X[2X ) ___________[0Xfunction
  [2X> ECM( [0X[3Xn[, Curves[, Limit1[, Limit2[, Delta]]]][0X[2X ) __________________[0Xfunction
  [6XReturns:[0X  A  list  of  two  lists: The first list contains the prime factors
            found,  and the second list contains remaining unfactored parts of
            [3Xn[0m, if there are any.
  
  This  function tries to factor [3Xn[0m using the Elliptic Curves Method (ECM). The
  argument  [3XCurves[0m is the number of curves to be tried. The argument [3XLimit1[0m is
  the initial first stage limit, and [3XLimit2[0m is the initial second stage limit.
  The argument [3XDelta[0m is the increment per curve for the first stage limit. The
  second  stage  limit  is adjusted appropriately. Defaults are chosen for all
  arguments which are omitted.
  
  [10XFactorsECM[0m recognizes the option [3XECMDeterministic[0m. If set, the choice of the
  curves  is deterministic. This means that in repeated runs of [10XFactorsECM[0m the
  same  curves  are  used, and hence for the same n the same factors are found
  after the same number of trials.
  
  The  Elliptic  Curves Method is based on the fact that exponentiation in the
  elliptic  curve  groups E(a,b)/n can be performed fast enough to compute for
  example  g^k!  for k large enough (e.g. 100000 or so) in a reasonable amount
  of  time  and  without  using much memory, and on Lagrange's Theorem. Assume
  that p is a prime divisor of n. Then Lagrange's Theorem states that if k! is
  a  multiple  of  |E(a,b)/p|,  then for any elliptic curve point g, the power
  g^k!  is  the  identity  element  of  E(a,b)/p.  In  this situation -- under
  reasonable  circumstances  --  the  factor p  can be determined by taking an
  appropriate gcd.
  
  In  practice,  the  algorithm chooses in some sense "better" products P_k of
  small  primes  rather  than  k! as exponents. After reaching the first stage
  limit with P_Limit1, it considers further products P_Limit1q for primes q up
  to  the  second  stage limit [3XLimit2[0m, which is usually set equal to something
  like 100 times the first stage limit. The prime q corresponds to the largest
  prime factor of the order of the group E(a,b)/p.
  
  A  prime divisor p is usually found if the largest prime factor of the order
  of  one of the examined elliptic curve groups E(a,b)/p is at most [3XLimit2[0m and
  the  second-largest  one  is  at most [3XLimit1[0m. Thus trying a larger number of
  curves  increases  the  chance  of  factoring [3Xn[0m as well as choosing a larger
  value for [3XLimit1[0m and/or [3XLimit2[0m. It turns out to be not optimal either to try
  a  large number of curves with very small [3XLimit1[0m and [3XLimit2[0m or to try only a
  few curves with very large limits. (Compare with [2XFactorsPminus1[0m ([14X3.2-1[0m).)
  
  The  elements  of  the  group  E(a,b)/n  are  the  points (x,y) given by the
  solutions  of  y^2 = x^3 + ax + by in the residue class ring (mod n), and an
  additional  point  infty  at  infinity, which serves as identity element. To
  turn  this  set  into  a  group, define the product (although elliptic curve
  groups  are  usually  written  additively, I prefer using the multiplicative
  notation   here   to  retain  the  analogy  to  [2XFactorsPminus1[0m  ([14X3.2-1[0m)  and
  [2XFactorsPplus1[0m  ([14X3.3-1[0m)) of two points p_1 and p_2 as follows: If p_1 <> p_2,
  let l be the line through p_1 and p_2, otherwise let l be the tangent to the
  curve C  given  by  the  above  equation  in the point p_1 = p_2. The line l
  intersects C in a third point, say p_3. If l does not intersect the curve in
  a  third  affine point, then set p_3 := infty. Define p_1 * p_2 by the image
  of p_3  under  the  reflection  across the x-axis. Define the product of any
  curve  point  p  and  infty  by  p  itself.  This -- more or less obviously,
  checking  associativity requires some calculation -- turns the set of points
  on the given curve into an abelian group E(a,b)/n.
  
  However,  the  calculations  are  done  in projective coordinates to have an
  explicit  representation  of  the  identity element and to avoid calculating
  inverses (mod n) for the group operation. Otherwise this would require using
  an  O((log  n)^3)-algorithm,  while  multiplication  (mod n)  is only O((log
  n)^2).  The  corresponding  equation is given by bY^2Z = X^3 + aX^2Z + XZ^2.
  This form allows even more efficient computations than the Weierstrass model
  Y^2Z  = X^3 + aXZ^2 + bZ^3, which is the projective equivalent of the affine
  representation y^2 = x^3 + ax + by mentioned above. The algorithm only keeps
  track of two of the three coordinates, namely X and Z. The curves are chosen
  in  a  way that ensures the order of the corresponding group to be divisible
  by 12.  This  increases the chance that it is smooth enough to find a factor
  of n.  The  implementation  follows  the description of R. P. Brent given in
  [Bre96],  pp.  5  --  8.  In  terms  of this paper, for the second stage the
  "improved standard continuation" is used.
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsECM(2^256+1,100,10000,1000000,100);[0X
    [4X[ [ 1238926361552897, [0X
    [4X      93461639715357977769163558199606896584051237541638188580280321 ][0X
    [4X    , [  ] ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
  
  [1X3.5 The Continued Fraction Algorithm (CFRAC)[0X
  
  [1X3.5-1 FactorsCFRAC[0m
  
  [2X> FactorsCFRAC( [0X[3Xn[0X[2X ) ________________________________________________[0Xfunction
  [2X> CFRAC( [0X[3Xn[0X[2X ) _______________________________________________________[0Xfunction
  [6XReturns:[0X  A list of the prime factors of [3Xn[0m.
  
  This  function  tries  to  factor  [3Xn[0m  using the Continued Fraction Algorithm
  (CFRAC),  also  known as Brillhart-Morrison Algorithm. In case of failure an
  error is signalled.
  
  Caution: The runtime of this function depends only on the size of [3Xn[0m, and not
  on  the  size of the factors. Thus if a small factor is not found during the
  preprocessing which is done before invoking the sieving process, the runtime
  is as long as if [3Xn[0m would have two prime factors of roughly equal size.
  
  The  Continued  Fraction  Algorithm tries to find integers x and y such that
  x^2  =  y^2  (mod n), but not pm x = pm y (mod n). In this situation, taking
  gcd(x  -  y,n) yields a nontrivial divisor of n. For determining such a pair
  (x,y),  the  algorithm  uses  the continued fraction expansion of the square
  root  of n.  If  x_i/y_i is a continued fraction approximation of the square
  root  of n,  then c_i := x_i^2 - ny_i^2 is bounded by a small constant times
  the  square  root  of n. The algorithm tries to find as many c_i as possible
  which  factor  completely over a chosen factor base (a list of small primes)
  or  with only one factor not in the factor base. The latter ones can be used
  if  and  only  if  a  second c_i with the same "large" factor is found. Once
  enough  values c_i have been factored, as a final stage Gaussian Elimination
  over GF(2) is used to determine which of the congruences x_i^2 = c_i (mod n)
  have  to  be  multiplied together to obtain a congruence of the desired form
  x^2  = y^2 (mod n). Let M be the corresponding matrix. Then the entries of M
  are given by M_ij = 1 if an odd power of the j-th element of the factor base
  divides  the  i-th  usable factored value, and M_ij = 0 otherwise. To obtain
  the  desired  congruence,  it  is  necessary that the rows of M are linearly
  dependent.  In other words, this means that the number of factored c_i needs
  to be larger than the rank of M, which is approximately given by the size of
  the factor base. (Compare with [2XFactorsMPQS[0m ([14X3.6-1[0m).)
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsCFRAC( Factorial(34) - 1 );[0X
    [4X[ 10398560889846739639, 28391697867333973241 ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
  
  [1X3.6 The Multiple Polynomial Quadratic Sieve (MPQS)[0X
  
  [1X3.6-1 FactorsMPQS[0m
  
  [2X> FactorsMPQS( [0X[3Xn[0X[2X ) _________________________________________________[0Xfunction
  [2X> MPQS( [0X[3Xn[0X[2X ) ________________________________________________________[0Xfunction
  [6XReturns:[0X  A list of the prime factors of [3Xn[0m.
  
  This  function  tries  to factor [3Xn[0m using the Single Large Prime Variation of
  the  Multiple Polynomial Quadratic Sieve (MPQS). In case of failure an error
  is signalled.
  
  Caution: The runtime of this function depends only on the size of [3Xn[0m, and not
  on  the  size of the factors. Thus if a small factor is not found during the
  preprocessing which is done before invoking the sieving process, the runtime
  is as long as if [3Xn[0m would have two prime factors of roughly equal size.
  
  The  intermediate  results  of a computation can be saved by interrupting it
  with  [10X[Ctrl][C][0m  and  calling  [10XPause();[0m from the break loop. This causes all
  data  needed  for  resuming  the  computation again to be pushed as a record
  [3XMPQSTmp[0m  on  the  options stack. When called again with the same argument [3Xn[0m,
  [10XFactorsMPQS[0m  takes  the record from the options stack and continues with the
  previously  computed  factorization  data.  For continuing the factorization
  process  in  another session, one needs to write this record to a file. This
  can  be done by the function [10XSaveMPQSTmp([3Xfilename[0m[10X)[0m. The file written by this
  function can be read by the standard [10XRead[0m-function of [5XGAP[0m.
  
  The  Multiple Polynomial Quadratic Sieve tries to find integers x and y such
  that  x^2  =  y^2  (mod n),  but not pm x = pm y (mod n). In this situation,
  taking gcd(x - y,n) yields a nontrivial divisor of n. For determining such a
  pair  (x,y), the algorithm chooses polynomials f_a of the form f_a(r) = ar^2
  + 2br + c with suitably chosen coefficients a, b and c which satisfy b^2 = n
  (mod a) and c = (b^2 - n)/a. The identity a * f_a(r) = (ar + b)^2 - n yields
  a congruence (mod n) with a perfect square on one side and a * f_a(r) on the
  other.  The  algorithm  uses  a  sieving  technique  similar to the Sieve of
  Eratosthenes  over  an  appropriately  chosen sieving interval to search for
  factorizations  of  values  f_a(r)  over  a  chosen  factor  base.  Any  two
  factorizations  with the same single "large" factor which does not belong to
  the  factor base can also be used. Taking more polynomials and hence shorter
  sieving  intervals  has  the  advantage  of  having to factor smaller values
  f_a(r) over the factor base.
  
  Once  enough  values  f_a(r)  have  been factored, as a final stage Gaussian
  Elimination  over  GF(2)  is  used to determine which congruences have to be
  multiplied  together  to  obtain  a congruence of the desired form x^2 = y^2
  (mod n).  Let M be the corresponding matrix. Then the entries of M are given
  by  M_ij  = 1 if an odd power of the j-th element of the factor base divides
  the  i-th  usable  factored  value,  and  M_ij  = 0 otherwise. To obtain the
  desired  congruence,  it  is  necessary  that  the  rows  of M  are linearly
  dependent.   In   other   words,  this  means  that  the  number  of  usable
  factorizations  of  values f_a(r) needs to be larger than the rank of M. The
  latter  is  approximately  equal  to  the  size of the factor base. (Compare
  with [2XFactorsCFRAC[0m ([14X3.5-1[0m).)
  
  [4X---------------------------  Example  ----------------------------[0X
    [4X[0X
    [4Xgap> FactorsMPQS( Factorial(38) + 1 );[0X
    [4X[ 14029308060317546154181, 37280713718589679646221 ][0X
    [4X[0X
  [4X------------------------------------------------------------------[0X
  
