summaryrefslogtreecommitdiffstats
path: root/crypto/bn/bn_prime.c
AgeCommit message (Expand)Author
2017-04-22Numbers greater than 1 are usually non-negative.David Benjamin
2016-11-15Check return value of some BN functions.Rich Salz
2016-08-10Change callers to use the new constants.Rich Salz
2016-06-29Whitespace cleanup in cryptoFdaSilvaYY
2016-06-25Handle BN_mod_word failures.David Benjamin
2016-06-18Useless header include of openssl/rand.hFdaSilvaYY
2016-06-13Add some missing return value checksMatt Caswell
2016-05-17Copyright consolidation 06/10Rich Salz
2016-04-28Don't leak memory on error in BN_generate_prime_exMatt Caswell
2016-01-28Restore NUMPRIMES as a numeric literalViktor Dukhovni
2016-01-27Remove EIGHT_BIT and SIXTEEN_BITRich Salz
2016-01-26Remove /* foo.c */ commentsRich Salz
2015-09-05RT3955: Reduce some stack usageRich Salz
2015-05-14Identify and move common internal libcrypto header filesRichard Levitte
2015-04-30free NULL cleanup 7Rich Salz
2015-03-17Fix probable_prime over large shiftMatt Caswell
2015-01-22Re-align some comments after running the reformat script.Matt Caswell
2015-01-22Run util/openssl-format-source -v -c .Matt Caswell
2014-12-30mark all block comments that need format preserving so thatTim Hudson
2014-06-01Tidy up, don't exceed the number of requested bits.Ben Laurie
2014-06-01Constify and reduce coprime random bits to allow for multiplier.Ben Laurie
2014-06-01Add a test to check we're really generating probable primes.Felix Laurie von Massenbach
2014-06-01Remove unused BIGNUMs.Felix Laurie von Massenbach
2014-06-01Refactor the first prime index.Felix Laurie von Massenbach
2014-06-01Try skipping over the adding and just picking a new random number.Felix Laurie von Massenbach
2014-06-01Generate safe primes not divisible by 3, 5 or 7.Felix Laurie von Massenbach
2014-06-01Add a method to generate a prime that is guaranteed not to be divisible by 3 ...Felix Laurie von Massenbach
2014-06-01Remove static from probable_prime_dh.Felix Laurie von Massenbach
2014-06-01Remove indentation from the goto targets.Felix Laurie von Massenbach
2013-06-04Ensure that, when generating small primes, the result is actually of theAdam Langley
2007-09-18Minimize stack utilization in probable_prime.Andy Polyakov
2006-09-18Ensure that the addition mods[i]+delta cannot overflow in probable_prime().Bodo Möller
2006-01-132 is a primeNils Larsch
2004-03-25Adjust various bignum functions to use BN_CTX for variables instead ofGeoff Thorpe
2003-11-04Put the first stage of my bignum debugging adventures into CVS. This codeGeoff Thorpe
2003-02-01Old-style callbacks can be NULL!Ben Laurie
2003-01-10Make sure everything that may be freed is allocated or initiated.Richard Levitte
2002-12-08Nils Larsch submitted;Geoff Thorpe
2002-12-08This is a first-cut at improving the callback mechanisms used inGeoff Thorpe
2001-09-04OpenSSL copyright notices ...Bodo Möller
2001-09-03Correct a typo.Geoff Thorpe
2001-09-03Use uniformly chosen witnesses for Miller-Rabin testBodo Möller
2000-11-06Constify the BIGNUM routines a bit more. The only trouble were theRichard Levitte
2000-02-05New functions BN_CTX_start(), BN_CTX_get(), BN_CTX_end() to accessUlf Möller
2000-02-03ispell (and minor modifications)Ulf Möller
2000-02-03Some 'const's for BNs.Bodo Möller
2000-02-02Include OpenSSL license.Bodo Möller
2000-02-02Tolerate negative numbers in BN_is_prime.Bodo Möller
2000-02-02rndsort{Miller, Rabin} primality test.Bodo Möller
2000-02-01Bug fix: BN_is_prime() would fail with a high probability for smallUlf Möller