6 Commits

Author	SHA1	Message	Date
Pavol Rusnak	9a8e982153	implement bip39 cache	2016-01-19 15:11:57 +01:00
Jochen Hoenicke	7d4cf5cedd	Optimized the bn_inverse method. ... The new method needs about 30 % less time for prime256k1 and is about twice as fast for other moduli. The base algorithm is the same. The code is also a bit smaller and doesn't need the 8 kb precomputed table. Important canges: 1. even/odd distinction so that we need to test only one of the numbers for being even. This also leads to less duplicated code. 2. Allow for shifting by 32 bits at a time in the even test. 3. Pack u,s and v,r into the same array, which saves a bit of stack memory. 4. Don't divide by two after subtraction; this simplifies code. 5. Abort as soon as u,v are equal, instead of subtracting them. 6. Use s instead of r after the loop; no negation needed. 7. New code that divides by 2^k fast without any precomputed values.	2015-03-17 19:17:47 +01:00
Pavol Rusnak	cb9ccc5cf4	remove all references to USE_PUBKEY_VALIDATE	2015-03-12 15:53:41 +01:00
Pavol Rusnak	f4e6010e18	implement BIP32 cache	2015-01-26 19:10:19 +01:00
Pavol Rusnak	03a8925e0f	rename BN_PRINT define to USE_BN_PRINT	2014-07-07 21:24:10 +02:00
Pavol Rusnak	b9d5896174	make pubkey validation optional, extract options to separate header	2014-07-07 20:14:36 +02:00