aboutsummaryrefslogtreecommitdiffstats
path: root/doc/examples
Commit message (Collapse)AuthorAgeFilesLines
...
* | Allow creation of SEC1 curveslloyd2008-08-302-3/+9
| |
* | Incomplete ECDSA test/examplelloyd2008-08-271-0/+14
|/
* Fix the DSA examples. Reindent.lloyd2008-06-2813-30/+50
|
* Update more of the exampleslloyd2008-06-273-5/+11
|
* Update pkcs10, passhash exampleslloyd2008-06-272-9/+16
|
* Update some of the examples for the recent API changeslloyd2008-06-277-28/+42
|
* Add missing headers in the example problems, noticed while compiling underlloyd2008-06-118-0/+9
| | | | GCC 4.3. Missing <memory> for auto_ptr and <cstdlib> for atoi
* Update passhash example with new S2K::new_random_salt signaturelloyd2008-05-241-1/+2
|
* Avoid using the global RNG in check_key, instead pass a reference.lloyd2008-05-246-13/+24
| | | | Update the examples
* Print the class tag type(s) on constructed formslloyd2008-05-081-0/+9
|
* Update ca.cpp with new signature of X509_CA::sign_requestlloyd2008-04-101-1/+5
|
* Have the ca example take all filenames as arguments instead of hardcoding.lloyd2007-10-201-10/+18
|
* Print the IPv4 address, DNS name, or URL included in the subject orlloyd2007-10-201-0/+6
| | | | issuer alternative names.
* Wrap lines in pk_bench and passhash to keep them under 80 columns.lloyd2007-10-191-2/+2
|
* If the LibraryInitializer is created with just default arguments, don'tlloyd2007-10-0724-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 LibraryInitializerlloyd2007-10-071-7/+19
| | | | constructor.
* Clean up the examples makefile a bit.1.7.0lloyd2007-03-131-9/+13
|
* Always print the exact value of the OID found in the ASN.1 example, evenlloyd2007-03-101-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,lloyd2007-03-092-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 Makefilelloyd2006-09-071-5/+1
|
* Make a passphrase optional for the DSA and RSA key generation exampleslloyd2006-09-042-12/+17
|
* Drop the fips140 example, doesn't build after recent changes and it'slloyd2006-08-231-59/+0
| | | | more or less useless in any case.
* 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
|
* Enable optimizations in the makefilelloyd2006-07-161-4/+2
|
* Extend the xor_ciph example to support longer keys, and update it tolloyd2006-07-161-18/+16
| | | | | use the new entry point for add_alias
* 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-162-1/+115
|
* Remove the to_lower function; turns out that both uses of itlloyd2006-06-191-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.lloyd2006-06-051-7/+0
|
* Change X509_Certificate::subject_info and issuer_info to returnlloyd2006-06-031-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.lloyd2006-05-192-14/+24
|
* Initial checkin1.5.6lloyd2006-05-1826-0/+2506