23 Commits (8318ac35fc12765334d71106ce7c9078f8b8ab68)

Author	SHA1	Message	Date
Yura Pakhuchiy	e7281cf9f5	Add GRS curve	6 years ago
Saleem Rashid	c70e440128	hasher: Replace hasher_Double with HASHER_*D ... This allows us to finely control when to use a single hash or a double hash in various places. For example, Bitcoin signatures use double SHA256, but Decred signatures use a single BLAKE256. However, both use double hashes for Base58.	6 years ago
Saleem Rashid	764cc4c6e8	bip32: Add secp256k1-decred	7 years ago
Saleem Rashid	b41a51805f	Use hasher_Raw instead of sha256_Raw	7 years ago
Jochen Hoenicke	55edf71e27	ed25519 support	8 years ago
Jochen Hoenicke	698f40f385	BIP-32 without gaps, prepare non-ecdsa curves ... * Split ecdsa_curve into curve_info and ecdsa_curve to support bip32 on curves that don't have a ecdsa_curve. * Don't fail in key derivation but retry with a new hash. * Adapted test case accordingly	8 years ago
Jochen Hoenicke	0bc1b70c4a	Use different seed modifier for different curves	8 years ago
Jochen Hoenicke	c983afd72f	Added curve type to HDNode ... Every curve gets it's own hierarchy and the curve is remembered in HD node. Fixed the private/public key derivations to use the right modulus.	8 years ago
Jochen Hoenicke	f2081d88d8	New jacobian_add that handles doubling. ... Fix bug where jacobian_add is called with two identical points.	9 years ago
Pavol Rusnak	2e09a9ff35	add b to ecdsa_curve structure	9 years ago
Pavol Rusnak	d659fd49a5	return back normalization of signatures	9 years ago
Roman Zeyde	7c58fc11a4	Add support for NIST256P1 elliptic curve ... This enables SSH ECDSA public key authentication.	9 years ago
Jochen Hoenicke	ec057a5102	"More" constant time point multiplication ... About the same speed, about the same precomputation table requirements. Simpler code.	9 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.	9 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