Factors

[David T. Ashley]

Also, if you run into notions you don't understand, try Wolfram's Mathworld,
i.e. for the definition of a prime number, try:

http://mathworld.wolfram.com/PrimeNumber.html

You might also pick up the Penguin Dictionary Of Mathematics.

Happy studying!

Dave.

> -----Original Message-----
> From: gmp-discuss-admin@swox.com [mailto:gmp-discuss-admin@swox.com]On
> Behalf Of Safuat Hamdy
> Sent: Thursday, November 14, 2002 1:08 AM
> To: gmp-discuss@swox.com
> Subject: Re: Factors
>
>
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> On Wednesday 13 November 2002 20:28, Jaideep Lamba wrote:
> > Dear Readers,
> >
> > I am interested in implementation of various factor finding
> algorithms. May
> > I request to please redirect me to papers / sources where I can find the
> > best factor finding algorithm for large numbers and their time
> complexity.
>
> <FLAMES>
> Your request is actually an impudence.  Searching google would give you
> probably more answers than asking innocent and busy readers.
> </FLAMES>
>
> Having said this, you should go and obtain the following book
>
> R.Crandall, C.Pomerance: Prime Numbers --- A Computational Perspective,
> Springer Verlag
>
> This book is fairly well written and reveals a lot of internal details of
> various factoring algorithms.  Since you ask your question so naively, I
> would discourage you strongly from going to real research papers,
> for this
> matter is really not trivial and requires knowledge on algebraic
> and analytic
> number theory in order to get all the details.
>
> As for ready to go implementations, try Paul Zimmermanns
> ECM-Implementations
> (exercise: use google or whatever to find it on the web), my own
> libiq comes
> with a Schnorr-Lenstra factorizer, LiDIA contains ECM, p-1, p+1,
> as well as
> the MPQS (LiDIA's code is not suitable for learning algorithms,
> though), and
> other readers such as Paul Leyland might give you pointers to NFS
> implementations.
>
>
> Best
>
> - --
>
> S. Hamdy                                |  All primes are odd except 2,
> Dept. of Mathematics & Statistics       |  which is the oddest of all.
> University of Calgary                   |
>                                         |
> unsolicited commercial e-mail           |
> is strictly not welcome                 |
> -----BEGIN PGP SIGNATURE-----
> Version: GnuPG v1.0.6 (GNU/Linux)
> Comment: For info see http://www.gnupg.org
>
> iD8DBQE90z3fwjuT2UdHuKURAk2aAJ9X0D2TjcM1DUE1IHPxxS8AG9tKZgCgi1mB
> +iP3cWEI1aKxwOboTKM3yuI=
> =2IJz
> -----END PGP SIGNATURE-----
>
>
> _______________________________________________
> gmp-discuss mailing list
> gmp-discuss@swox.com
> https://gmplib.org/mailman/listinfo/gmp-discuss
>
>
>