| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Have the ca example take all filenames as arguments instead of hardcoding. | lloyd | 2007-10-20 | 1 | -10/+18 |
| | | |||||
| * | Print the IPv4 address, DNS name, or URL included in the subject or | lloyd | 2007-10-20 | 1 | -0/+6 |
| | | | | | issuer alternative names. | ||||
| * | Wrap lines in pk_bench and passhash to keep them under 80 columns. | lloyd | 2007-10-19 | 1 | -2/+2 |
| | | |||||
| * | If the LibraryInitializer is created with just default arguments, don't | lloyd | 2007-10-07 | 24 | -104/+56 |
| | | | | | | | | 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). | ||||
| * | Optionally, you can specify an argument that is passed to the LibraryInitializer | lloyd | 2007-10-07 | 1 | -7/+19 |
| | | | | | constructor. | ||||
| * | Clean up the examples makefile a bit.1.7.0 | lloyd | 2007-03-13 | 1 | -9/+13 |
| | | |||||
| * | Always print the exact value of the OID found in the ASN.1 example, even | lloyd | 2007-03-10 | 1 | -1/+6 |
| | | | | | if we found a human readable name for it (in that case we print both). | ||||
| * | Add a password hashing example. It uses PBKDF2/SHA-1 with 10000 iterations, | lloyd | 2007-03-09 | 2 | -1/+81 |
| | | | | | | a 48-bit seed, and a 96-bit hash. The example can both create new hashes and confirm existing ones. | ||||
| * | Remove the (deleted) fips140 example from the Makefile | lloyd | 2006-09-07 | 1 | -5/+1 |
| | | |||||
| * | Make a passphrase optional for the DSA and RSA key generation examples | lloyd | 2006-09-04 | 2 | -12/+17 |
| | | |||||
| * | Drop the fips140 example, doesn't build after recent changes and it's | lloyd | 2006-08-23 | 1 | -59/+0 |
| | | | | | more or less useless in any case. | ||||
| * | 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 |
| | | |||||
| * | Enable optimizations in the makefile | lloyd | 2006-07-16 | 1 | -4/+2 |
| | | |||||
| * | Extend the xor_ciph example to support longer keys, and update it to | lloyd | 2006-07-16 | 1 | -18/+16 |
| | | | | | | use the new entry point for add_alias | ||||
| * | 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 | 2 | -1/+115 |
| | | |||||
| * | Remove the to_lower function; turns out that both uses of it | lloyd | 2006-06-19 | 1 | -1/+3 |
| | | | | | | | | | | | | | | | | within the library were to perform case-insensitive matching, so simply implement that instead. Place all of the character set handling functions into a Charset namespace (and update all callers). Remove the iso2local/local2iso/iso2utf/utf2iso functions, replaced by the new charset transcoder stuff. Initialize the transcoder stored in the global library state upon initialization. | ||||
| * | Don't print a CRL from the X.509 CA example. | lloyd | 2006-06-05 | 1 | -7/+0 |
| | | |||||
| * | Change X509_Certificate::subject_info and issuer_info to return | lloyd | 2006-06-03 | 1 | -6/+4 |
| | | | | | | | | | | a vector of strings instead of a single string that combines the relevent fields. Change how X509_Certificate stores information. Renamed self_signed() to is_self_signed() | ||||
| * | Update some of the examples to reflect the new APIs. | lloyd | 2006-05-19 | 2 | -14/+24 |
| | | |||||
| * | Initial checkin1.5.6 | lloyd | 2006-05-18 | 26 | -0/+2506 |
 |
index : botan.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiffstats |