aboutsummaryrefslogtreecommitdiffstats
path: root/src
Commit message (Expand)AuthorAgeFilesLines
* Replace the set of prime products with a new set generated by a Pythonlloyd2008-09-181-64/+65
* Move biging_wordmul inlined into the only place where it is used,lloyd2008-09-171-27/+0
* Add an optimization suggested by Yves Jerschow to combine the fourlloyd2008-09-172-11/+20
* Change the constructor for LubyRackoff. Previously it took a string,lloyd2008-09-152-27/+33
* Remove the cache for BigInt::sig_words. I'm baffled how it is it workslloyd2008-09-151-16/+14
* Update BigInt::grow_reg and grow_to to be non-constlloyd2008-09-151-2/+2
* Rename blocks to the slightly more descriptive x_size_8lloyd2008-09-141-6/+6
* Pass a pointer to a HashFunction to the MGF1 constructor, and have thatlloyd2008-09-142-7/+12
* The Memory_Exhaustion exception was only thrown from mem_pool.cpp, solloyd2008-09-141-0/+14
* Enable square optimization for 16x16lloyd2008-09-131-2/+0
* Add IETF MODP 8192 DH grouplloyd2008-09-121-0/+47
* Fix loop variable naming (i in outermost scope, then j, remove unneeded k)lloyd2008-09-111-20/+20
* Add 16x16->32 word Comba multiply and squarelloyd2008-09-092-176/+716
* Hoist load, since compiler may not be able to do so due to aliasinglloyd2008-09-091-4/+7
* Add comment about bigint_simple_sqr just being an optimization to work around...lloyd2008-09-091-1/+6
* Use individual variables intead of an array inside the Salsa20 function,lloyd2008-09-091-37/+65
* Add implementation of Salsa20 stream cipherlloyd2008-09-092-0/+182
* In get_cipher, do not call cipher->set_iv unless the IV is non-emptylloyd2008-09-091-1/+4
* Reindentlloyd2008-09-071-172/+172
* Comment fixlloyd2008-09-071-1/+1
* Remove bigint_mul_add_words. It was only used now in two callers,lloyd2008-09-072-31/+38
* Inline BigInt::Rep::operator[], BigInt::sig_words, and BigInt::Rep::sig_wordslloyd2008-09-071-58/+0
* Inline BigInt::operator[]lloyd2008-09-071-16/+0
* Combine redundant definitions of blocks variablelloyd2008-09-071-7/+6
* Inline BigInt::is_zerolloyd2008-09-071-11/+1
* Inline similarly in karatsuba_mullloyd2008-09-071-11/+32
* In karatsuba_square, inline the sequencelloyd2008-09-071-3/+25
* Comment cleanuplloyd2008-09-071-4/+2
* Rewrite without gotoslloyd2008-09-071-135/+11
* Inline bigint_sub2 into bigint_monty_redclloyd2008-09-071-5/+20
* Inline bigint_cmp in bigint_monty_redc (using goto, the horror; I'm basicallylloyd2008-09-071-27/+10
* Move bigint_monty_redc to its own file to make asm implementations easierlloyd2008-09-072-29/+205
* Use i instead of j for iterator varlloyd2008-09-071-4/+4
* Remove iostream includelloyd2008-09-051-2/+0
* Optimize right shift a littlelloyd2008-09-051-14/+38
* Replace __builtin_ctzl with a new ctz function in bit_ops.hlloyd2008-09-051-1/+1
* Wrap the BigInt register in a small class that caches the significantlloyd2008-09-052-38/+81
* Revert change to dl_work_factor for now - breaks ElGamal testslloyd2008-09-051-0/+14
* Rewrite dl_work_factor using a lookup table with data from RFC 3526,lloyd2008-09-051-16/+18
* Add the IKE 6144-bit MODP group, from RFC 3526lloyd2008-09-051-0/+37
* Define the functions from bit_ops.h as inline template functions, insteadlloyd2008-09-051-68/+0
* A possible optimization to low_zero_bits (which was showing up hot inlloyd2008-09-021-6/+22
* Where bit_ops.h was used to get xor_buf, include xor_buf.h insteadlloyd2008-09-0226-25/+25
* Reduce RW creation min also to 512 for benchmarkslloyd2008-09-021-1/+1
* The counter is not specified, so do not mention itlloyd2008-08-311-1/+1
* Add DSS groups with 2048 and 3072 bit p values (and 256 bit q subgroups).lloyd2008-08-311-105/+141
* Allow generating 512 and 768 bit DSA keys.lloyd2008-08-311-6/+9
* Allow creating 512 bit RSA keys again (for benchmark, mostly)lloyd2008-08-311-1/+1
* Merge mp_sqr.cpp and mp_mul.cpp into mp_karat.cpp, since there is a lotlloyd2008-08-272-147/+132
* Use -BigInt(1) instead of BigInt("-1") to avoid the parsing overhead.lloyd2008-08-271-2/+2
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-20 17:32:26 +0000