47 Commits (2edd17ab54a63ea6d624f9d7162be1507968bd8e)

Author	SHA1	Message	Date
Pavol Rusnak	af01ef71fc	bignum: add bn_format	7 years ago
Pavol Rusnak	459f4a5e7a	add setbit, clearbit, testbit and xor to bignum	8 years ago
Alex Beregszaszi	7e7e462be7	bignum: introduce bn_one	8 years ago
Alex Beregszaszi	7956c2f2f1	bignum: implement bitcount	8 years ago
Alex Beregszaszi	29e82018cd	bignum: rename bn_load_uint* to bn_read_uint*	8 years ago
Alex Beregszaszi	97454d9cbc	bignum: use the compiler's built in memory copy for bn_copy	8 years ago
Alex Beregszaszi	d061139da9	bignum: introduce load uint32/uint64	8 years ago
Alex Beregszaszi	dd25a2ee5a	bignum: introduce copy	8 years ago
Alex Beregszaszi	62a0db8c4e	bignum: introduce read/write_le	8 years ago
Pavol Rusnak	d61a151900	add bn_divmod1000 including unit test	8 years ago
Jochen Hoenicke	533c3beb63	Fixed uncompress_coords for NIST curve ... The bn_sqrti was broken. It didn't handle primes where all bits are set in the lowest limb.	8 years ago
Roman Zeyde	437f8b3856	bignum: constant time implementation for bn_mod()	9 years ago
Jochen Hoenicke	472b90d8ed	Added myself to copyright lines.	9 years ago
Jochen Hoenicke	f93b003cbc	Extended comments, new function bn_add, a bug fix. ... Describe normalized, partly reduced and reduced numbers. Comment which function expects which kind of input. Removed unused bn_bitlen. Add bn_add that does not reduce. Bug fix in ecdsa_validate_pubkey: bn_mod before bn_is_equal. Bug fix in hdnode_private_ckd: bn_mod after bn_addmod.	9 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
Jochen Hoenicke	6ba4d288b0	Cleaned up bignum code ... 1. Fixed bn_multiply_step to handle small primes. 2. Removed many calls to bn_mod to prevent side-channel leakage.	9 years ago
Roman Zeyde	793234a0ec	bignum: use constant time comparisons	9 years ago
Roman Zeyde	ea16aa0b86	Remove unnecessary #include "secp256k1.h"	9 years ago
Roman Zeyde	587d6a65ea	Update documentation regarding ECDSA curves support	9 years ago
Roman Zeyde	7c58fc11a4	Add support for NIST256P1 elliptic curve ... This enables SSH ECDSA public key authentication.	9 years ago
Pavol Rusnak	21d0bb437a	cleanup coding style	9 years ago
netanelkl	3fd32df8ed	More of the same.	9 years ago
Jochen Hoenicke	56f5777b68	Refactored code for point doubling. ... New function `bn_mult_3_2` that multiplies by 3/2. This function is used in point_double and point_jacobian_double. Cleaned up point_add and point_double, more comments.	9 years ago
Jochen Hoenicke	1700caf2ad	scalar_mult based on Jacobian representation ... This version of scalar_mult should be faster and much better against side-channel attacks. Except bn_inverse and bn_mod all functions are constant time. bn_inverse is only used in the last step and its input is randomized. The function bn_mod is only taking extra time in 2^32/2^256 cases, so in practise it should not occur at all. The input to bn_mod is also depending on the random value. There is secret dependent array access in scalar_multiply, so cache may be an issue.	9 years ago
Jochen Hoenicke	d4788bddfd	Added modulus to bn_subtractmod	9 years ago
Jochen Hoenicke	62b95ee414	Optimized conversion functions. ... Also added a few more comments	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	e37ba822e6	bn_substract -> bn_subtractmod, bn_substract_noprime -> bn_subtract ... remove dead code	9 years ago
Jochen Hoenicke	7e98c02afd	Added comments to the tricky algorithms. ... Added invariants for bn_multiply and bn_inverse. Explain that bn_multiply and bn_fast_mod doesn't work for an arbitrary modulus. The modulus must be close to 2^256.	9 years ago
Pavol Rusnak	03a8925e0f	rename BN_PRINT define to USE_BN_PRINT	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	67eb76fd1b	llu -> ull for MSVC compatibility	11 years ago
Pavol Rusnak	2e4ec7fe0a	introduce ecdsa_address_to_hash160	11 years ago
Pavol Rusnak	8423c7abfd	add check that pub.y != res.y	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	f4f246f3d7	optimize computations	11 years ago
Pavol Rusnak	7ed18947ba	simplify divmod58	11 years ago
Pavol Rusnak	74a5b04b81	verify now supports compressed keys	11 years ago
Pavol Rusnak	638cf2310b	cleanup	11 years ago
Pavol Rusnak	92f070498f	add function for computing addresses	11 years ago
Pavol Rusnak	1fda6fe339	add bn_zero, bn_bits, bn_lshift, bn_rshift, bn_normalize to bignum	11 years ago
Pavol Rusnak	afc9bcfe30	implement bip32 - https://en.bitcoin.it/wiki/BIP_0032	11 years ago
Pavol Rusnak	07d1c22730	refactor code -> bignum.c/h	11 years ago