9 Commits

Author	SHA1	Message	Date
Ulf Möller	335c4f0966	BN_rand_range() needs a BN_rand() variant that doesn't set the MSB.	2001-02-20 00:23:07 +00:00
Bodo Möller	e306892994	Simplify BN_rand_range	2001-02-10 00:34:02 +00:00
Bodo Möller	35ed8cb8b6	Integrate my implementation of a countermeasure against ... Bleichenbacher's DSA attack. With this implementation, the expected number of iterations never exceeds 2. New semantics for BN_rand_range(): BN_rand_range(r, min, range) now generates r such that min <= r < min+range. (Previously, BN_rand_range(r, min, max) generated r such that min <= r < max. It is more convenient to have the range; also the previous prototype was misleading because max was larger than the actual maximum.)	2001-02-08 12:14:51 +00:00
Ulf Möller	57e7d3ce15	Bleichenbacher's DSA attack	2001-02-07 22:24:35 +00:00
Ulf Möller	4d524e10b4	nicer manpages	2000-02-24 11:55:57 +00:00
Bodo Möller	953aa79040	A couple of things were reversed for BN_pseudo_rand ...	2000-01-27 21:09:25 +00:00
Ulf Möller	38e33cef15	Document DSA and SHA. ... New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?)	2000-01-27 19:31:26 +00:00
Richard Levitte	bb075f8833	Update all links so they will be rendered better.	2000-01-27 01:25:31 +00:00
Ulf Möller	dd8dec69b8	Document the BN library.	2000-01-23 22:06:24 +00:00