summaryrefslogtreecommitdiffstats
path: root/crypto/bn/bn_prime.c (follow)
Commit message (Expand)AuthorAgeFilesLines
* Restore NUMPRIMES as a numeric literalViktor Dukhovni2016-01-281-2/+0
* Remove EIGHT_BIT and SIXTEEN_BITRich Salz2016-01-281-6/+2
* Remove /* foo.c */ commentsRich Salz2016-01-261-1/+0
* RT3955: Reduce some stack usageRich Salz2015-09-051-5/+9
* Identify and move common internal libcrypto header filesRichard Levitte2015-05-141-1/+1
* free NULL cleanup 7Rich Salz2015-05-011-5/+3
* Fix probable_prime over large shiftMatt Caswell2015-03-171-1/+11
* Re-align some comments after running the reformat script.Matt Caswell2015-01-221-11/+11
* Run util/openssl-format-source -v -c .Matt Caswell2015-01-221-520/+538
* mark all block comments that need format preserving so thatTim Hudson2014-12-301-2/+4
* Tidy up, don't exceed the number of requested bits.Ben Laurie2014-06-011-38/+41
* Constify and reduce coprime random bits to allow for multiplier.Ben Laurie2014-06-011-5/+8
* Add a test to check we're really generating probable primes.Felix Laurie von Massenbach2014-06-011-2/+2
* Remove unused BIGNUMs.Felix Laurie von Massenbach2014-06-011-7/+0
* Refactor the first prime index.Felix Laurie von Massenbach2014-06-011-3/+3
* Try skipping over the adding and just picking a new random number.Felix Laurie von Massenbach2014-06-011-30/+109
* Generate safe primes not divisible by 3, 5 or 7.Felix Laurie von Massenbach2014-06-011-6/+16
* Add a method to generate a prime that is guaranteed not to be divisible by 3 ...Felix Laurie von Massenbach2014-06-011-29/+55
* Remove static from probable_prime_dh.Felix Laurie von Massenbach2014-06-011-42/+40
* Remove indentation from the goto targets.Felix Laurie von Massenbach2014-06-011-3/+5
* Ensure that, when generating small primes, the result is actually of theAdam Langley2013-06-041-10/+61
* Minimize stack utilization in probable_prime.Andy Polyakov2007-09-181-2/+2
* Ensure that the addition mods[i]+delta cannot overflow in probable_prime().Bodo Möller2006-09-181-6/+3
* 2 is a primeNils Larsch2006-01-141-1/+2
* Adjust various bignum functions to use BN_CTX for variables instead ofGeoff Thorpe2004-03-251-6/+11
* Put the first stage of my bignum debugging adventures into CVS. This codeGeoff Thorpe2003-11-041-0/+5
* Old-style callbacks can be NULL!Ben Laurie2003-02-011-0/+2
* Make sure everything that may be freed is allocated or initiated.Richard Levitte2003-01-101-1/+1
* Nils Larsch submitted;Geoff Thorpe2002-12-081-2/+2
* This is a first-cut at improving the callback mechanisms used inGeoff Thorpe2002-12-081-31/+49
* OpenSSL copyright notices ...Bodo Möller2001-09-041-1/+1
* Correct a typo.Geoff Thorpe2001-09-031-1/+1
* Use uniformly chosen witnesses for Miller-Rabin testBodo Möller2001-09-031-5/+5
* Constify the BIGNUM routines a bit more. The only trouble were theRichard Levitte2000-11-061-8/+9
* New functions BN_CTX_start(), BN_CTX_get(), BN_CTX_end() to accessUlf Möller2000-02-051-17/+22
* ispell (and minor modifications)Ulf Möller2000-02-041-2/+2
* Some 'const's for BNs.Bodo Möller2000-02-031-8/+9
* Include OpenSSL license.Bodo Möller2000-02-031-0/+53
* Tolerate negative numbers in BN_is_prime.Bodo Möller2000-02-021-23/+34
* rndsort{Miller, Rabin} primality test.Bodo Möller2000-02-021-182/+91
* Bug fix: BN_is_prime() would fail with a high probability for smallUlf Möller2000-02-021-0/+1
* Seek out and destroy another evil cast.Ulf Möller2000-01-311-4/+7
* Make output of "openssl dsaparam 1024" more interesting :-)Bodo Möller2000-01-301-0/+3
* Make DSA_generate_parameters, and fix a couple of bugBodo Möller2000-01-301-10/+28
* Document DSA and SHA.Ulf Möller2000-01-271-19/+1
* Document the BN library.Ulf Möller2000-01-231-12/+17
* Document the DH library, and make some minor changes along the way.Ulf Möller2000-01-221-5/+30
* Precautions against using the PRNG uninitialized: RAND_bytes() nowUlf Möller2000-01-131-0/+1
* Turn BN_prime_checks into a macro.Bodo Möller2000-01-121-10/+11
* More evil cast removal.Ben Laurie1999-06-031-3/+3