aboutsummaryrefslogtreecommitdiffstats
path: root/doc/examples/factor.cpp
Commit message (Collapse)AuthorAgeFilesLines
* More pubkey doc updateslloyd2011-04-081-0/+154
|
* Convert most of the documentation to reStructured Text, addinglloyd2011-04-041-154/+0
| | | | | | | | | | | | | | | | | | | a makefile to build it with Sphinx (http://sphinx.pocoo.org/). Previously credits.txt listed public domain code sources; instead directly credit the authors in the relevant files and delete that file. Drop the draft FIPS 140 security policy; I can't imagine FIPS 140 validation will ever happen, and if it does, I don't want anything to do with it. Also drop the internals doc, which was so out of date (and incomplete) as to be worthless. Move the tutorials and InSiTo pdfs into old/ for the time being, until anything relevant from them can be filtered out and converted into RST.
* Small cleanupslloyd2010-06-021-9/+8
|
* Fix factor wrt rename of primality test functionslloyd2010-03-231-1/+1
|
* Fix minor errors and warnings in the examples. Remove boost dependency fromlloyd2010-03-031-3/+8
| | | | rng_test example.
* Add copyright and license notes to pretty much every file that didn't have them,lloyd2009-12-311-0/+6
| | | | | | | | including the examples and self-test code. Most of these files had not copyright/license information at all; since a major point of the examples is to allow users to copy and paste code that already does something they want, an ambigious license is not good.
* Add LibraryInitializers to the examples, instead of relying on lazy init.lloyd2009-03-171-0/+2
| | | | Patch from David X Callaway.
* Move rng.{cpp,h} from core to rng/ topdirlloyd2008-10-261-3/+2
| | | | | | | | | | | | | | Add a new class AutoSeeded_RNG that is a RandomNumberGenerator that wraps up the logic formerly in RandomNumberGenerator::make_rng. make_rng in fact now just returns a new AutoSeeded_RNG object. AutoSeeded_RNG is a bit more convenient because - No need to use auto_ptr - No need to dereference (same syntax everywhere - it's an underestimated advantage imo) Also move the code from timer/timer_base to timer/
* Update examples for recent API changeslloyd2008-10-081-1/+1
|
* Fix the DSA examples. Reindent.lloyd2008-06-281-1/+2
|
* Update some of the examples for the recent API changeslloyd2008-06-271-8/+11
|
* Avoid using the global RNG in check_key, instead pass a reference.lloyd2008-05-241-2/+3
| | | | Update the examples
* If the LibraryInitializer is created with just default arguments, don'tlloyd2007-10-071-2/+0
| | | | | | | bother creating it, just let it be initialized lazily when needed. Reindents in encypt.cpp and hash_fd.cpp (indenting the brace after a try statement).
* Don't bail out of the rho computation until 2^32 tries, since thelloyd2006-07-161-3/+3
| | | | | | cycle size is based on the square root of the prime factors, bailing after 2^16 would mean we would be unlikely to find any factors larger than 32 bits.
* Have to (potentially) factor the result from the Rho computation, as itlloyd2006-07-161-4/+7
| | | | might be composite.
* Move the declaration of a_factor outside the loop, and use a do looplloyd2006-07-161-4/+5
| | | | | instead of a while loop so it doesn't have to be initialized each time through.
* Remove some completely redundant code in factorize()lloyd2006-07-161-6/+1
|
* Break out after 2^16 tries, so we restart from a different random pointlloyd2006-07-161-4/+8
| | | | | | | | if we don't find a cycle fairly quickly. Use (x^2 + x) % n instead of (x^2 - 1) % n; it seems to be giving better (ie, faster) results, though to be honest I'm not sure exactly why this should be the case.
* Make factorize() iterative instead of recursive lloyd2006-07-161-22/+50
|
* Remove whitespace, add a slightly informative comment, etclloyd2006-07-161-2/+2
|
* Remove a debugging print statementlloyd2006-07-161-4/+3
| | | | | Change the output to sort the factors, and use ':' instead of '=' so the output exactly matches that of the BSD 'factor' program.
* Add an example that performs factoring (using Pollard's Rho algorithm)lloyd2006-07-161-0/+110