Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Move gtk+ example to doc/examples | lloyd | 2008-09-29 | 5 | -0/+695 |
| | |||||
* | Drop old Makefile. Move tests to examples directory. | lloyd | 2008-09-28 | 2 | -0/+157 |
| | |||||
* | Modularize the Adler32 checksum in checksums/adler32 | lloyd | 2008-09-28 | 4 | -7/+7 |
| | | | | | | | | | Add a new option --disable-modules which allows for disabling any set of modules that normally would be autoloaded. Rename the Botan feature test macros from BOTAN_EXT_BLAH to BOTAN_HAS_BLAH, which will be much more sensible especially when everything is done in this fashion (eg, BOTAN_HAS_BLOWFISH or BOTAN_HAS_RSA, etc) | ||||
* | Add comment explaining why EAX tests for XTEA, Skipjack, and Noekeon | lloyd | 2008-09-27 | 1 | -6/+19 |
| | | | | | | | are not run (the implementations in LTC are incompatible with the ones in Botan, mostly due to endian differences in underspecified algorithms). The DES, 3DES, AES, Twofish, Blowfish, RC2, RC5, RC6, and SAFER-SK tests of EAX mode from LTC all pass. | ||||
* | Add the set of EAX test vectors from libtomcrypt | lloyd | 2008-09-27 | 1 | -0/+461 |
| | |||||
* | Fix link for EAX tet prog | lloyd | 2008-09-27 | 2 | -2/+5 |
| | |||||
* | Add a program that reads a set of test vectors for EAX mode using several | lloyd | 2008-09-27 | 1 | -0/+227 |
| | | | | | different algorithms taken from libtomcrypt. Requires Boost.Regex currently (would like to remove that at some point). | ||||
* | Add an example database row encryptor | lloyd | 2008-09-24 | 1 | -0/+134 |
| | |||||
* | If the Zlib module is not compiled in, don't #error and abort the whole | lloyd | 2008-09-24 | 2 | -5/+6 |
| | | | | compile, just skip adding a Zlib filter into the Pipe. | ||||
* | Fail at runtime if bzip2 is not compiled in, instead of compile time | lloyd | 2008-09-24 | 1 | -3/+9 |
| | |||||
* | Create a RNG object, update for new interface for DSA paramater generation | lloyd | 2008-09-18 | 1 | -6/+15 |
| | |||||
* | Add missing <memory> include | lloyd | 2008-09-18 | 1 | -0/+1 |
| | |||||
* | Add testers for the NIST CAVS PQGGen and SigGen tests (part of FIPS-140 | lloyd | 2008-09-18 | 2 | -0/+194 |
| | | | | DSA test suite) | ||||
* | Add a program that checks the ressol() implementation using a set of | lloyd | 2008-09-18 | 1 | -0/+77 |
| | | | | randomly generated primes. | ||||
* | Add a test app for random_prime in examples | lloyd | 2008-09-18 | 1 | -0/+69 |
| | |||||
* | Fix compilation with latest RNG API | lloyd | 2008-09-18 | 1 | -1/+3 |
| | |||||
* | Remove warning | lloyd | 2008-09-18 | 1 | -3/+2 |
| | |||||
* | Makefile for examples now requires GNU make, was getting way too long | lloyd | 2008-09-18 | 2 | -130/+23 |
| | | | | using normal make syntax. | ||||
* | Add a program that checks the X9.31 PRNG against a set of NIST test vectors | lloyd | 2008-09-18 | 1 | -0/+134 |
| | |||||
* | Add the program I wrote to write a set of many RSA keys (used for benchmarking | lloyd | 2008-09-17 | 1 | -0/+35 |
| | | | | and profiling, mostly). | ||||
* | Generate a random 2k bit DSA group instead of 1024-bit JCE default | lloyd | 2008-08-30 | 1 | -1/+3 |
| | |||||
* | Fix xor_ciph example | lloyd | 2008-08-30 | 1 | -2/+4 |
| | |||||
* | Fix the DSA examples. Reindent. | lloyd | 2008-06-28 | 13 | -30/+50 |
| | |||||
* | Update more of the examples | lloyd | 2008-06-27 | 3 | -5/+11 |
| | |||||
* | Update pkcs10, passhash examples | lloyd | 2008-06-27 | 2 | -9/+16 |
| | |||||
* | Update some of the examples for the recent API changes | lloyd | 2008-06-27 | 7 | -28/+42 |
| | |||||
* | Add missing headers in the example problems, noticed while compiling under | lloyd | 2008-06-11 | 8 | -0/+9 |
| | | | | GCC 4.3. Missing <memory> for auto_ptr and <cstdlib> for atoi | ||||
* | Update passhash example with new S2K::new_random_salt signature | lloyd | 2008-05-24 | 1 | -1/+2 |
| | |||||
* | Avoid using the global RNG in check_key, instead pass a reference. | lloyd | 2008-05-24 | 6 | -13/+24 |
| | | | | Update the examples | ||||
* | Print the class tag type(s) on constructed forms | lloyd | 2008-05-08 | 1 | -0/+9 |
| | |||||
* | Update ca.cpp with new signature of X509_CA::sign_request | lloyd | 2008-04-10 | 1 | -1/+5 |
| | |||||
* | 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 |
| |