botan.git - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Collapse)	Author	Age	Files	Lines
*	Add specialized reduction for P-521 along with 9x9 Comba routines.	lloyd	2014-11-15	11	-12/+461
\| \| \| \| \|	Roughly 35-50% faster on my laptop (depending on if mlock is enabled, the overhead in that allocator is becoming much more of a hotspot).
*	Use noexcept on swap	lloyd	2014-11-04	1	-1/+1
\|
*	Handle new source file	lloyd	2014-10-06	1	-4/+0
\|
*	Asserts here are nice	lloyd	2014-08-09	1	-2/+7
\|
*	Move mul and square operations on a elliptic curve to CurveGFp so we	lloyd	2014-08-09	4	-213/+279
\| \| \| \| \|	can use different representations/operations depending on the curve (eg, using a specialized version for P-256 reduction)
*	Avoid GCC 4.9 strict-overflow warning	lloyd	2014-05-03	1	-3/+2
\|
*	Any fixed MR iterations is probably wrong for somebody. Allow the user	lloyd	2014-04-25	4	-7/+49
\| \| \| \| \| \|	to specify a probability as well as if n was randomly chosen or not. If the input is random use a better bounds to reduce the number of needed tests.
*	Use 20 Miller-Rabin iterations regardless of the size of the integer. This	lloyd	2014-04-13	4	-186/+42
\| \| \| \| \|	provides a much better worst-case error bound. Also take the nonce from anywhere in the usable range rather than limiting the bit size.
*	Fix a bug in Miller-Rabin primality testing introduced in 1.8.3	lloyd	2014-04-10	1	-5/+6
\| \| \| \| \| \| \| \|	where we chose a single random nonce and tested it repeatedly, rather than choosing new nonces each time. Reported by Jeff Marrison. Also remove a pointless comparison (also pointed out by Jeff) and add an initial test using a witness of 2.
*	Avoid a ubsan warning on GCC 4.9 due uninitialized sign enum being	lloyd	2014-03-30	2	-5/+1
\| \| \| \|	read during swap (in the move constructor)
*	Clang fixes	lloyd	2014-02-09	1	-1/+0
\|
*	Guess I won't be needing these	lloyd	2014-01-18	1	-1/+0
\|
*	Move lib into src	lloyd	2014-01-10	51	-0/+8875