| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
| |
Camellia exposed by the OpenSSL module is parameterized by the key
length, much as AES is, while the version in the main source uses a
single name/type for all variants. For consistency, convert to using a
key length parameterized name in our version as well. In the future
this might allow for better loop unrolling, etc but currently we don't
make use of that.
|
|
|
|
|
|
|
| |
was broken, and after fixing that and trying to compile the module it
becamse clear that the Qt mutex did not work at all with recent Qt
versions. Taking this as a clear indicator that it is not being used,
remove it.
|
|
|
|
| |
All reported by Patrick Pelletier.
|
|
|
|
|
| |
list of maintainer mode flags. It produces some very useful warnings,
but also a lot of noisy junk that I really don't care about.
|
|\
| |
| |
| | |
and 'bc49da394c675517b140a404c19094020d6e9d40'
|
| |
| |
| |
| |
| | |
rather than one past the end. Reported by Stuart Maclean on the
mailing list.
|
| |
| |
| |
| |
| |
| |
| | |
Much faster, especially when using 8192 bit groups as OpenSSL does by
default.
Use BOTAN_DLL symbol visibility macros.
|
|/
|
|
|
|
|
|
|
|
|
| |
for this.
Add a new function that identifies a named SRP group from the N/g
params - this is important as we need to verify the SRP groups, the
easiest way to do that is to to force them to be a known/published
value.
Add the 1536, 3072, 4096, 6144, and 8192 bit groups from RFC 5054
|
| |
|
| |
|
|
|
|
|
| |
on decoding by default, and add a comment showing how to enable it for
encoding.
|
|
|
|
|
|
|
| |
how much we ask for on the basis of how many bits we're counting each
byte as contributing. Change /dev/*random estimate to 7 bits per byte.
Small cleanup in HMAC_RNG.
|
|
|
|
|
| |
list of directory names (without the open DIRs) plus the one currently
active dir.
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
of giving /dev/random, EGD, and CryptoAPI a full 8 bits per byte of
entropy, estimate at 6 bits.
In the proc walker, allow more files to be read, read more of any
particular file, and count each bit for 1/10 as much as before.
Reading more of the file seems especially valuable, as some files are
quite random, whereas others are very static, and this should ensure
we read more of the actually unpredictable inputs.
Prefer /dev/random over /dev/urandom
|
|
|
|
|
|
| |
waiting for a full kilobyte. This is for the benefit of DSA/ECDSA
which want a call to add_entropy to update the state in some way,
passing just a hash input which might be as small as 20 bytes.
|
|
|
|
| |
Cassidy, sent to the mailing list.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
by TLS (relies on the finished message check). Add a class for reading
files created by GnuTLS's srptool.
|
|
|
|
|
| |
loop (size_t overflow), likely causing a segfault. Not exploitable as
far as I can tell, beyond the obvious crashing.
|
|
|
|
|
| |
in the Client_Hello parser. Works, tested with GnuTLS command line
client.
|
|
|
|
|
| |
interface but it's a plausible start. Will probably have more insights
after adding TLS hooks.
|
| |
|
| |
|
|
|
|
| |
an amalgamation and the app is compiled in Unicode mode.
|
| |
|
| |
|
| |
|
|
|
|
| |
explicit cast.
|
| |
|
|
|
|
| |
cpuid intrinsic) and older GCC (no cpuid.h before 4.3)
|
|
|
|
| |
as they seem to understand it as of GCC 4.6 and Clang 2.9.
|
| |
|
|
|
|
|
| |
the same, so clearly GCC 4.6 and/or the Core i7 are very good about
renames, but might help on less capable systems.
|
|
|
|
| |
clock types we know about that have macros defined for them.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
-mtune=generic as with i486. Python's platform reports an i386 when
running on a Core Duo on MacOS X 10.6, then using -march=i368 causes a
link failure due to missing atomic adds in libstdc++. PR 152
Also use generic for i586.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
- Check the cache; if found, return value
- Populate cache, if the value is already there, delete the old
object and save the new one.
- Recheck the cache value
Raja <[email protected]> pointed out on the list that this could race
if multiple threads called a lookup function in close succession while
the cache was cold. All of them would fail the lookup, then each of
them would add it, but the values returned would be deleted by other
threads.
Instead, declare that first write wins. Then, the cache stays
consistent even if there is a race, the only issue is an extra search
and delete.
Modify GOST and Skein, as their name() function did not roundtrip
properly which caused failures otherwise.
|
|
|
|
|
| |
Try to detect the mtn revision (by shelling out to mtn automate), and
including it in build.h as BOTAN_VERSION_VC_REVISION.
|
|
|
|
| |
most compilers will probably compile this into a conditional anyway.
|