| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
|
|
|
|
|
| |
These were generated using the FIPS 186-3 PRNG, with seed values
generating by applying SHA-256 to the UTF-8 encodings of the strings
"Botan 2048 DSS seed #51" and "Botan 3072 DSS seed #24"
|
| |
|
| |
|
|
|
|
|
|
| |
of similar-but-not-identical code between them. (Can't merge for performance
reasons, squaring is a special case of multiplication allowing extra
optimizations)
|
|
|
|
|
| |
Instead just call the u64bit constructor and invert using the BigInt
operator.
|
|
|
|
| |
the key schedule, and perhaps offers slightly better code generation.
|
|\
| |
| |
| | |
and 'df7d36d4e4fe81092c682b0ef92ac3a9ef12cbd3'
|
| | |
|
|/
|
|
| |
keying is supported (see section 2.3 of the specification for details)
|
|
|
|
| |
unexpected (see ticket #23, http://bugs.randombit.net/show_bug.cgi?id=23)
|
| |
|
|
|
|
| |
find square roots modulo a prime. Contributed by FlexSecure GmbH
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
bits <= 1 -> error
bits == 2 -> choose 2 or 3 at random
bits == 3 -> choose 5 or 7 at random
bits == 4 -> choose 11 or 13 at random
bits >= 5 -> procedure used previously.
Tested by running random_prime() with random bit sizes <= 16 until it had
generated all <= 16 bit primes.
|
|
|
|
|
|
| |
for the implementation in Library_State. Instead explicitly call deref_alias
on global_state() wherever the old freestanding version was used. This serves
to make (more) uses of the global state explicit rather than implicit.
|
|
|
|
|
|
|
| |
PKCS8::encrypt_key - this is slightly less flexible, but removes the
dependency on the Library_State object. And if someone wants to use
a different algorithm, they just have to pass in an actual value for the
pbe string instead of letting it default to the empty string.
|
| |
|
|
|
|
|
|
|
|
|
| |
config state: how long successful validations should be cached, and the
amount of slack to allow on time boundary checks. Now these are passed
as arguments to the constructor, as a pair of 32-bit integers representing
the number of seconds to allow as slack and the number of seconds to cache
validations for. They default to the same compiled in defaults as before,
24 hours (86400 seconds) and 30 minutes (1800 seconds), respectively.
|
|
|
|
|
|
|
|
| |
In reality, Config was a singleton, with the only owner being the
Library_State object. Theoretically one could create and use another Config
instance, but in practice it was never done. Reflect the reality and inline
the members and public functions of Config in Library_State, removing Config
entirely.
|
| |
|
|
|
|
| |
make_rng()
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
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.
|
| |
|
| |
|
|
|
|
|
|
| |
They were probably not a good idea. If nothing else, these functions might
throw bad_alloc, and possibly other errors. Something broad like std::exception
might be applicable, but that seems pointlessly broad.
|
|
|
|
| |
key or IV; it does not reference the global RNG.
|
|
|
|
| |
in the library ccode.
|
|
|
|
|
|
|
|
|
|
|
|
| |
see if (p-1)/2 was prime, and if so set q to that. This is to deal with
certain bogus DH formats (PKCS #3, specifically; the 'modern' ANSI formats
always provide the q subgroup value).
However this required access to the RNG. Rather than push RNG usage all
the way down into that part of DL group, simply remove the feature.
Since PKCS #3 format is only really used for DH keys, it will not much
affect anything functionally (that I can see).
|
| |
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
| |
Public version doesn't need an RNG argument.
|
|
|
|
|
|
|
|
|
| |
a) I am sure we really want to include this (proprietary, unanalyzed?)
PRNG in Botan
b) I have a chance to add test cases and clean up the code.
Also note a few more changes in the changelog, and set a provisial release
date for sometime in July.
|
|
|
|
|
|
| |
testability (have a card still, but the drivers are for 2.4 kernel and
seemingly not 64-bit or thread safe, so it's pretty much a paperweight
right now).
|
|
|
|
| |
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)
|
| |
|
|
|
|
| |
constructor, instead of referencing it directly.
|
|
|
|
| |
public key object loading hooks.
|
| |
|
|
|
|
| |
specify it when we instantiate one in Builtin_Modules
|
|
|
|
| |
http://lists.randombit.net/pipermail/botan-devel/2008-June/000559.html
|
|
|
|
|
|
|
|
|
| |
I didn't understand why but had let it slip, but now that it's clear that
their declarations were not in scope at the point of their definitions
(seen via GCC's -Wmissing-declarations) it is quite obvious: the compiler
had no idea the functions should be compiled with an alternative ELF
scoping. Since the declarations are now included, remove the BOTAN_DLL
macros from the .cpp file.
|