11 Commits (a757693fe3904f60d80d36fe0bfe437dea55e02e)

Author	SHA1	Message	Date
Jochen Hoenicke	ec057a5102	"More" constant time point multiplication ... About the same speed, about the same precomputation table requirements. Simpler code.	10 years ago
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.	10 years ago
Pavol Rusnak	019d779a94	Revert "Revert "add more precomputation to ecdsa signing"" ... This reverts commit 3747ba4323.	10 years ago
Pavol Rusnak	3747ba4323	Revert "add more precomputation to ecdsa signing" ... This reverts commit 06dd166a82.	10 years ago
Pavol Rusnak	612f5ab050	fix copyright headers	10 years ago
Pavol Rusnak	06dd166a82	add more precomputation to ecdsa signing	10 years ago
Jan Pochyla	2e22e731d6	remove field name struct init for MSVC compatibility	11 years ago
Pavol Rusnak	e04ec2a831	add check to mnemonic_from_data as well	11 years ago
Pavol Rusnak	9205c0d952	use canonical signatures (if S > Order/2: S = Order - S)	11 years ago
Pavol Rusnak	678e5b1af2	use #if instead of #ifdef for conditional macros	11 years ago
Pavol Rusnak	ccbc219b29	import sources	11 years ago