Richard Levitte 6a2347ee45 Remove the last bn_wexpand()s that made us break constness. Of ... course, that means we need to handle the cases where the two arrays to bn_mul_recursive() and bn_mul_part_recursive() differ in size. I haven't yet changed the comments that describe bn_mul_recursive() and bn_mul_part_recursive(). I want this to be tested by more people before I consider this change final. Please test away!		2000-12-04 17:11:59 +00:00
..
asm	Correct a number of syntax errors.	2000-11-22 18:20:31 +00:00
.cvsignore	Ignore Makefile.save	1999-04-29 16:04:54 +00:00
bn_add.c	Document the BN library.	2000-01-23 22:06:24 +00:00
bn_asm.c	Make the definition of bn_add_words() match the definition.	2000-11-18 20:49:02 +00:00
bn_blind.c	There have been a number of complaints from a number of sources that names	2000-06-01 22:19:21 +00:00
bn_ctx.c	BN_CTX-related fixes.	2000-11-08 10:05:34 +00:00
bn_div.c	modular arithmetics	2000-11-26 16:42:38 +00:00
bn_err.c	Change error message to "bignum too long"	2000-12-04 09:24:54 +00:00
bn_exp2.c	Fix the recently introduced test that checks if the result is 0	2000-11-30 22:58:27 +00:00
bn_exp.c	Move reduction step from BN_mod_exp to BN_mod_exp_mont_word.	2000-11-30 09:45:26 +00:00
bn_gcd.c	Corrections to the comments in BN_mod_inverse.	2000-11-30 12:53:53 +00:00
bn_kron.c	BN_sqrt	2000-11-30 00:18:19 +00:00
bn_lcl.h	Remove the last bn_wexpand()s that made us break constness. Of	2000-12-04 17:11:59 +00:00
bn_lib.c	Change error message to "bignum too long"	2000-12-04 09:24:54 +00:00
bn_mod.c	More BN_mod_... functions.	2000-11-26 18:31:32 +00:00
bn_mont2.c	Changes to Lenka's Montgomery implementation.	2000-11-30 17:35:17 +00:00
bn_mont2.h	Changes to Lenka's Montgomery implementation.	2000-11-30 17:35:17 +00:00
bn_mont.c	More constification of the BN library.	2000-11-16 22:43:32 +00:00
bn_mpi.c	More constification of the BN library.	2000-11-16 22:43:32 +00:00
bn_mul.c	Remove the last bn_wexpand()s that made us break constness. Of	2000-12-04 17:11:59 +00:00
bn_prime.c	Constify the BIGNUM routines a bit more. The only trouble were the	2000-11-06 21:15:54 +00:00
bn_prime.h	Move primes to read-only segment.	2000-02-16 13:24:06 +00:00
bn_prime.pl	Move primes to read-only segment.	2000-02-16 13:24:06 +00:00
bn_print.c	Constify bn_dump1 implementation so that it matches the prototype	2000-11-17 08:36:10 +00:00
bn_rand.c	New function BN_bntest_rand() to detect more BN library bugs.	2000-12-02 07:32:57 +00:00
bn_recp.c	modular arithmetics	2000-11-26 16:42:38 +00:00
bn_shift.c	Fix BN_rshift, which caused lots of trouble.	2000-11-30 22:34:57 +00:00
bn_sqr.c	modular arithmetics	2000-11-26 16:42:38 +00:00
bn_sqrt.c	Move reduction step from BN_mod_exp to BN_mod_exp_mont_word.	2000-11-30 09:45:26 +00:00
bn_word.c	Fix for BN_mul_word(a, 0).	2000-09-04 15:30:14 +00:00
bn.h	Change error message to "bignum too long"	2000-12-04 09:24:54 +00:00
bn.mul
bnspeed.c	- Pseudo-seed the PRNG in programs used for "make test"	2000-01-14 17:55:37 +00:00
bntest.c	forgot to remove the loop variable	2000-12-02 16:20:04 +00:00
divtest.c	Include rand.h so RAND_pseudo_bytes may be declared.	2000-02-27 22:57:53 +00:00
exp.c	- Pseudo-seed the PRNG in programs used for "make test"	2000-01-14 17:55:37 +00:00
expspeed.c	functionality for BN_mod_sqrt timings	2000-12-01 09:41:21 +00:00
exptest.c	Cosmetic changes.	2000-02-05 21:28:09 +00:00
Makefile.ssl	"make depend"	2000-12-01 08:48:42 +00:00
todo
vms-helper.c	Avoid abort() throughout the library, except when preprocessor	2000-09-04 15:34:43 +00:00