openbsd/src/lib/libcrypto/bn/bn_mont.c, branch libressl-v3.3.4 A mirror of https://github.com/libressl/openbsd.git https://git.lua4.win/openbsd/atom?h=libressl-v3.3.4 2017-01-21T11:00:47+00:00 Add ct and nonct versions of BN_mod_inverse for internal use 2017-01-21T11:00:47+00:00 beck 2017-01-21T11:00:47+00:00 urn:sha1:48df727a3547375dae8622c34fb55bdf5ef2c44c ok jsing@ Split out BN_div and BN_mod into ct and nonct versions for Internal use. 2017-01-21T10:38:29+00:00 beck 2017-01-21T10:38:29+00:00 urn:sha1:55a172a1ed5b0cd8f7de3628fcc2e56df6716d59 ok jsing@ BN_CTX_get() can fail - consistently check its return value. 2015-02-09T15:49:22+00:00 jsing 2015-02-09T15:49:22+00:00 urn:sha1:15dc63f9715f4f10924a705d6a4cc564afe2129e There are currently cases where the return from each call is checked, the return from only the last call is checked and cases where it is not checked at all (including code in bn, ec and engine). Checking the last return value is valid as once the function fails it will continue to return NULL. However, in order to be consistent check each call with the same idiom. This makes it easy to verify. Note there are still a handful of cases that do not follow the idiom - these will be handled separately. ok beck@ doug@ Only import cryptlib.h in the four source files that actually need it. 2014-07-11T08:44:49+00:00 jsing 2014-07-11T08:44:49+00:00 urn:sha1:74e2c009c83ad374bd6acdcfc376a384e25ab007 Remove the openssl public includes from cryptlib.h and add a small number of includes into the source files that actually need them. While here, also sort/group/tidy the includes. ok beck@ miod@ Stop including standard headers via cryptlib.h - pull in the headers that 2014-07-10T13:58:23+00:00 jsing 2014-07-10T13:58:23+00:00 urn:sha1:c917c683bc93c68fbf4310ac181f7906e76b3c94 are needed in the source files that actually require them. ok beck@ miod@ tags as requested by miod and tedu 2014-06-12T15:49:31+00:00 deraadt 2014-06-12T15:49:31+00:00 urn:sha1:59f4f2c61d71e266d37dd2fc97615b3fd35b4721 malloc() result does not need a cast. 2014-06-07T14:41:57+00:00 deraadt 2014-06-07T14:41:57+00:00 urn:sha1:800fbde652d67326eeb163d56d8f72ebb239b3c4 ok miod Emergency knfectomie requested by tedu@. 2014-05-08T13:20:49+00:00 jsing 2014-05-08T13:20:49+00:00 urn:sha1:819648a77046c753ca0119b11b5d28f7a277dcf6 When I grow up, I want to write workaround for long long multiplications 2014-04-23T19:17:48+00:00 miod 2014-04-23T19:17:48+00:00 urn:sha1:2b6194972603c42800a3b08dec4925ab370d6bd1 under __TANDEM systems and compilers, using hardcoded octal numbers. NOT. Lacking a proof that--for this implementation--exposure of Montgomery 2014-04-19T13:31:24+00:00 guenther 2014-04-19T13:31:24+00:00 urn:sha1:a092cc42c2784b8fd7d39254deb6e25e59f729a5 multiplication or RSA blinding parameters doesn't permit retroactive timing analysis of the secrets, we'll do the stupidly cheap thing and cleanse them before freeing them. ok deraadt@