home *** CD-ROM | disk | FTP | other *** search
-
- KillPrime 1.01 ----------> PGP's nightmare !!
- --------------
-
- *)KillPrime will find (if you are lucky) the prime factors of a given
- number. It will use 3 way of searching.
-
- *)KillPrime NEEDS BigNum.library and a 68020 or faster processor.
-
- *)KillPrime does'nt do anything, all the algorithms are contained in
- the library !!
-
- *)Source included.
-
- -------------------------------------------
- KillPrime is a Ringard' Production 96
- -------------------------------------------
-
- BigNum.library is EMailWare.
-
- Allenbrand Brice
- 5, Rue du Manège
- 68100 Mulhouse
- FRANCE
-
- EMail: allenbrand@nucleus.fr
-
- -------------------------------------------
-
- Usage :
- -------
-
- KillPrime 122313146587 RHO or DIFFC or BRUTE eventualy DEEP=number
-
- examples :
- ----------
-
- KillPrime 1234567891 RHO
- KillPrime 1234567891 RHO DEEP 10
- KillPrime 1234567891 RHO DEEP 31
- KillPrime 1234567891 DIFFC
- KillPrime 1234567891 DIFFC DEEP 10
- KillPrime 1234567891 BRUTE -> DEEP useless
-
- RHO, DIFFC and BRUTE are library based methods to search for prime factors.
- It can be very long until they find something, but they search...faster
- than you !!
-
- By default DEEP=10
-
- -------------------------------------------
-
- !!!:
-
- *) Parameter DEEP is only here to decide how long KillPrime will try to strip
- a number.
-
- RHO Method :
- *) If a try wasn't lucky, it doesn't mean that a second will fail too ! *Magic*
-