| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
| |
with the aid of macro hackery, at the moment).
Change DH feature macro to BOTAN_HAS_DIFFIE_HELLMAN
Change NR feature macro to BOTAN_HAS_NYBERG_RUEPPEL
|
| |
|
| |
|
|
|
|
|
|
|
| |
algorithm could not be found, or X if the test fails. Before, one could
disable (say) NR, and the NR tests would all look to pass, because they
are being silently skipped. This gives some feedback that the test is
not actually being run.
|
| |
|
|
|
|
|
|
| |
the underlying implementation goop remains in the core library instead of
being shunted off, due to various dependencies it has (most of which it
shouldn't).
|
| |
|
| |
|
| |
|
|
|
|
| |
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)
|
| |
|
|
|
|
| |
instead of always using the global PRNG.
|
|
|
|
| |
of using the global RNG object.
|
|
|
|
|
|
|
|
| |
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)
|
| |
| |
| |
| |
| |
| |
| |
| |
| | |
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.
|
|/ |
|
|
|
|
| |
reinterpret_cast
|
|
|
|
|
| |
algorithms exist. They haven't been used since the 'minimal' module was
removed in Botan 1.3.14
|
|
|
|
| |
exception upto the top level, that's what it's there for.
|
|
|
|
| |
self-test sources
|
|
|
|
| |
because it turns out to be something of a legal minefield.
|
|
|