8 Commits

Author	SHA1	Message	Date
Bodo Möller	ff612904d2	Comment	2001-03-08 16:53:30 +00:00
Bodo Möller	80d89e6a6a	Sign-related fixes (and tests). ... BN_mod_exp_mont does not work properly yet if modulus m is negative (we want computations to be carried out modulo |m|).	2000-12-07 08:48:58 +00:00
Bodo Möller	bc5f2740d2	Move 'q->neg = 0' to those places where it is needed ... (just in cases someone uses a negative modulus)	2000-12-07 07:55:26 +00:00
Bodo Möller	aa66eba7c8	BN_mod_sqrt documentation/comment	2000-12-06 21:33:58 +00:00
Bodo Möller	bac685417a	Faster BN_mod_sqrt algorithm for p == 5 (8).	2000-12-06 12:25:33 +00:00
Bodo Möller	25439b76ad	Move reduction step from BN_mod_exp to BN_mod_exp_mont_word. ... Fix BN_mod_exp_simple for a==0 (mod m). Skip useless round in BN_mod_sqrt (1 is always a square, no need to test BN_kronecker for it).	2000-11-30 09:45:26 +00:00
Bodo Möller	cd2eebfd64	BN_sqrt	2000-11-30 00:18:19 +00:00
Bodo Möller	265592b99a	Add bn_kron.c (BN_kronecker), which I forgot in the previous commit. ... Also add the next file in advance so that I can't forget this one :-)	2000-11-28 06:37:43 +00:00