| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Move rng.{cpp,h} from core to rng/ topdir | lloyd | 2008-10-26 | 1 | -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 changes | lloyd | 2008-10-08 | 1 | -1/+1 |
| | | |||||
| * | Fix the DSA examples. Reindent. | lloyd | 2008-06-28 | 1 | -1/+2 |
| | | |||||
| * | Update some of the examples for the recent API changes | lloyd | 2008-06-27 | 1 | -8/+11 |
| | | |||||
| * | Avoid using the global RNG in check_key, instead pass a reference. | lloyd | 2008-05-24 | 1 | -2/+3 |
| | | | | | Update the examples | ||||
| * | If the LibraryInitializer is created with just default arguments, don't | lloyd | 2007-10-07 | 1 | -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 the | lloyd | 2006-07-16 | 1 | -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 it | lloyd | 2006-07-16 | 1 | -4/+7 |
| | | | | | might be composite. | ||||
| * | Move the declaration of a_factor outside the loop, and use a do loop | lloyd | 2006-07-16 | 1 | -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() | lloyd | 2006-07-16 | 1 | -6/+1 |
| | | |||||
| * | Break out after 2^16 tries, so we restart from a different random point | lloyd | 2006-07-16 | 1 | -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 | lloyd | 2006-07-16 | 1 | -22/+50 |
| | | |||||
| * | Remove whitespace, add a slightly informative comment, etc | lloyd | 2006-07-16 | 1 | -2/+2 |
| | | |||||
| * | Remove a debugging print statement | lloyd | 2006-07-16 | 1 | -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) | lloyd | 2006-07-16 | 1 | -0/+110 |
 |
index : botan.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiffstats |