| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
caller. The resulting code is longer and somewhat harder to read, but it's
giving 25-30% performance increases on my Core2, and something a bit
lower but still measurable on the P4.
|
|
|
|
|
|
|
|
|
| |
how big q should be.
Add FIPS 186-3 DSA parameter generation, this allows for generating larger
(2048 and 3072 bit) DSA keys. At this time there do not seem to be official
test vectors for 186-3, and I have not checked against other implementations.
Tests will be constructed using the latest OpenSSL snapshot.
|
|
|
|
| |
current register size; reads return 0, writes extend the buffer.
|
| |
|
|
|
|
| |
and actually reduced the total line count.
|
|
|
|
|
|
| |
members of DL_Group (the only place they were called within the source, and
outside of some rather esoteric things probably the only place you would
ever need it).
|
| |
|
|
|
|
|
|
| |
newline should always be added, even if the output would normally fit
entirely on the current line. Monotone needs this for compatability with
the Crypto++ implementation of base64.
|
|
|
|
| |
mem_pool.cpp with debug enabled.
|
|
|
|
|
| |
as I can tell) the last of the global data, with the exception of the single
global_lib_state pointer in libstate.cpp
|
| |
|
|
|
|
|
| |
Add include directives for enums.h in the headers that need it now that
it isn't being pulled in by symkey.h
|
|
|
|
| |
of NO_CERT_PATH_LIMIT to enums.h
|
|
|
|
| |
RNG considers itself seeded.
|
|
|
|
|
|
|
| |
causing allocators that were never used to allocate (and thus, later
deallocate) memory. This was causing a noticable slowdown when the mmap
based allocator was in used (based on the strace output, this was mostly
due to the calls to msync).
|
|
|
|
|
|
|
| |
the LibraryInitializer class, rather than global functions floating
around inside the Init namespace.
Allow callers to provide an alternative Modules object.
|
|
|
|
|
| |
of the list. The only time when the other behavior was desired was inside
the load() function, which now simply appends to the engines vector itself.
|
|
|
|
|
|
|
|
|
|
| |
handle the case where an allocator is added that has the same name as one
already registered.
Flush the cached allocator pointer when the default is changed.
Mark comparison operations in Pooling_Allocator::Memory_Block as inline;
this seems to help the STL sort and binary search algorithms tremendously.
|
|
|
|
|
|
| |
exposing the actual search objects to the user rather than wrapping them
in functions. Primarily this is to avoid the Visual Studio bug alluded to
in the last commit.
|
|
|
|
| |
for.
|
|
|
|
| |
the path limit integer to a boolean)
|
|
|
|
| |
ones which were visible via base classes, and the empty constructors.
|
| |
|
|
|
|
| |
the interfaces previously included in X509_PublicKey and PKCS8_PrivateKey.
|
| |
|
|
|
|
|
|
| |
X509_PublicKey object now offers interfaces that return encoder and
decoder objects. Eventually these changes will make it much easier to
support alternate key formats like OpenPGP.
|
|
|
|
| |
x509self.cpp, the other a block of code in X509_CA's constructor).
|
| |
|
|
|
|
|
| |
ever needed it to pull a few pieces of information from the key, which
it now gets by calling pure virtual functions implemented by its children.
|
|
|
|
| |
class definition in 1.4.12
|
|
|
|
|
| |
clear(), which have been declared in the appropriate places in (former)
subclasses of Algorithm
|
|
|
|
| |
the various types it wants to cache.
|
|
|
|
|
| |
since the RNG merger in 1.5.0, they have been effectively the same type
anyway.
|
|
|
|
| |
way back around 0.7.7, and has served no useful purpose since.
|
|
|
|
| |
as well as the cipher name
|
|
|
|
|
| |
pipe.cpp; apparently GCC was eliding them completely from the shared library
otherwise, meaning Boost.Python couldn't reference them.
|
| |
|
| |
|
|
|
|
| |
use a little extra workspace, this makes that simpler to do.
|
|
|
|
|
|
| |
was used.
Make a variant of bigint_simple_mul, bigint_simple_sqr, for mp_sqr.cpp
|
|
|
|
|
|
|
|
|
|
| |
Move the inner-most loop of Montgomery into bigint_mul_add_words, in
mp_muladd.cpp
Use bigint_mul_add_words for the inner loop of bigint_simple_multiply
Move the compare/subtract at the end of the Montomgery algorithm into
bigint_monty_redc
|
|
|
|
|
|
| |
as C (for replacing by asm later), and another that performs a subtract
if needed (inside powm_mnt.cpp). That way an asm version of the Montgomery
algorithm won't have to deal with calling other functions.
|
|
|
|
| |
shared between the C++ and assembly versions.
|
|
|
|
|
| |
addressing rather than having to keep all four pointers around.
Unfortunately GCC does not seem to be taking advantage of this.
|
| |
|
|
|
|
|
| |
internals (Gamma and FIPS_186_RNG) have both been removed, so there
is no need to keep the friend declarations.
|
|
|
|
|
|
| |
otherwise any Engines added after startup (eg, application-specific
ones) would only be used for new algorithm - it wouldn't be possible
for them to override existing implementations.
|
|
|
|
| |
were any engines built into the library, they were used no matter what.
|
|
|
|
|
|
|
|
| |
declaration.
Remove not_before and not_after variables, as they were only used once.
Use the computed Key_Constraints value when signing a new certificate.
|
|
|
|
| |
be in the forseeable future.
|