| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
|
|
|
|
|
|
|
| |
run until after the block ended, which was after set_global_state(0)
had run, causing crashes in the destructors that attempted to free memory.
Restructure the argument handling, it is significantly easier to understand
now. Only create the rng where it is needed.
|
|
|
|
|
|
|
| |
the test suite.
Instead of exiting, just carry on; the full test suite will check if the
problem is real or if std::numeric_limits is just wonky.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
now uses signing instead of encryption.
|
|
|
|
| |
Randomly generate the RW keys as well, removing all need for the keys/ dir
|
|
|
|
| |
also now reporting key generation and (for DSA) parameter generation times.
|
| |
|
|
|
|
| |
8192, DH 8192
|
|
|
|
| |
keying is supported (see section 2.3 of the specification for details)
|
|
|
|
|
|
|
|
|
|
|
| |
RandomNumberGenerator, and make ANSI_X931_PRNG's implementations just
forward the arguments to the underlying RNG. This allows seeding the RNG
even if no entropy modules are loaded into the library. Also it allows
actually adding user-specified data; to do it otherwise would require
creating the RNG objects yourself and retaining a pointer to the Randpool,
which is pretty bogus.
Move Null_RNG to rng.h
|
| |
|
|
|
|
| |
where it is needed.
|
| |
|
| |
|
|
|
|
|
|
|
| |
Randpool, it will query them as needed (or if asked to do so). New function
make_rng() that creates an RNG (X9.31 backed by a Randpool) and seeds it.
Remove the entropy source related code from the Modules/Builtin_Modules
classes.
|
|
|
|
| |
access to /dev/random (will be cleaned up shortly)
|
|
|
|
|
|
|
|
|
| |
Probably some variation of it will be added back in later, at least
to do basic checks like that primes are really odd (and we can do
basic primality checks, etc, even with an RNG).
Alternative: call check_key() manually on public keys you load with an
RNG object.
|
|
|
|
| |
constructors.
|
|
|
|
|
| |
a RNG reference, a group, and an (optional) private key. The public key
is now always rederived from the private.
|
| |
|
|
|
|
|
|
|
|
| |
reference, along with PKCS8::load_key
get_pbe no longer calls new_params() on the newly instantiated instance,
which is not backwards compatible (you have to either call new_params
yourself, or explicitly set the iteration count, salt, etc)
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
argument in favor of referencing the global PRNG argument
|
|
|
|
| |
instead of always using the global PRNG.
|
|
|
|
| |
of using the global RNG object.
|
|
|
|
| |
instead of introducing new typedefs.
|
|
|
|
|
|
|
|
| |
from the NIST CAVS dataset, taken on June 7 2008 from
http://csrc.nist.gov/groups/STM/cavp/standards.html
AES-128, AES-192, AES-256, and 2 and 3-key TripleDES variants are
all tested.
|
|
|
|
| |
to use) explicit arguments to the constructor instead of being hardcoded.
|
|
|
|
| |
Update the examples
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
random bits. Now they take a reference to a RandomNumberGenerator object.
This was applied several times out, so now the constructors to private
key objects also take a RandomNumberGenerator& argument. This is also true
for a number of randomized algorithms (Miller-Rabin, for instance).
You can get a reference to the global PRNG with
global_state().prng_reference()
This is a provisional thing: and warning: it is not thread safe! If this
is a problem instead keep per-thread PRNGs and pass them were needed.
|
|\
| |
| |
| |
| |
| | |
51f9ee5180a5cacdfff31504266e883b7bb0eb00)
to branch 'net.randombit.botan.remove-libstate' (head 636b767b9686261418b1cb45a6271edeef87501b)
|
| |\
| | |
| | |
| | |
| | |
| | | |
6afe2db1f710f75bc27e189bb8bdb23613ce1ca3)
to branch 'net.randombit.botan.remove-libstate' (head e40f0dbdfd847024c30fa0092c2acefc19a550b8)
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
essentially a facade for the RNG object living in the global library state.
Rewrite all callers to directly invoke the global state object: this makes
it more clear what functions are actually accessing mutable state outside of
the normal reference graph (and thus, which functions will have to be
altered in order to remove this dependency). Other facades remain in place
for the configuration object and the memory allocator factory.
|
|/ / |
|
|/
|
|
|
|
|
|
|
|
|
| |
- The allow_ca policy value is no longer checked. Callers should check
if the request is for a CA cert and treat it accordingly; this makes
it simpler to to case-by-case decisions (expecially among multiple
threads)
- Instead of a single time value, a u32bit representing the number of
seconds from now the certificate should expire, the start and end times
are passed explicitly as two X509_Time values.
|
| |
|
|\
| |
| |
| | |
and '9fe0310805932b889bdfa17c9213f2b97d47ab6a'
|