| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Note range of versions affected by CVE-2016-9132 | Jack Lloyd | 2016-11-28 | 1 | -0/+2 |
| | | | | | [ci skip] | ||||
| * | Update news | Jack Lloyd | 2016-11-28 | 1 | -1/+1 |
| | | |||||
| * | Check for overflow in BER decoder EOC scanning | Jack Lloyd | 2016-11-27 | 1 | -1/+10 |
| | | |||||
| * | Fix Sphinx formatting errors | Jack Lloyd | 2016-11-06 | 1 | -3/+5 |
| | | | | | [ci skip] | ||||
| * | Fix ReST formatting [ci skip] | Jack Lloyd | 2016-10-26 | 1 | -1/+1 |
| | | |||||
| * | Final changes for 1.11.33 release1.11.33 | Jack Lloyd | 2016-10-26 | 1 | -0/+14 |
| | | |||||
| * | Update my email address and PGP keys | Jack Lloyd | 2016-10-25 | 1 | -2/+2 |
| | | | | | | | | [email protected] is still a valid email address for me but I am using [email protected] going forward. [ci skip] | ||||
| * | Update for 1.11.31 release1.11.31 | Jack Lloyd | 2016-08-30 | 1 | -0/+18 |
| | | |||||
| * | Doc updates | Jack Lloyd | 2016-04-28 | 1 | -2/+2 |
| | | | | | [ci skip] | ||||
| * | Release 1.11.291.11.29 | Jack Lloyd | 2016-03-20 | 1 | -2/+25 |
| | | |||||
| * | Update news for 1.11.27 release1.11.27 | Jack Lloyd | 2016-02-01 | 1 | -3/+5 |
| | | |||||
| * | Fix heap overflow in ECC point multiplication | Jack Lloyd | 2016-02-01 | 1 | -1/+34 |
| | | | | | | | | | | | | | | | If affine coordinates larger than the prime modulus were given, a later multiplication could overflow the size of an allocated output buffer, which was sized based on the size of the prime. This will cause an overflow into either the system heap or if the mlock/mmap pool allocator is in use, then into the adjacent key material stored in the pool. Reported by Alex Gaynor who found it with AFL Also fix a one word overwrite in P-521 reduction. Found with AFL | ||||
| * | Fix (nearly) infinite loop in RESSOL (modular square root). | Jack Lloyd | 2016-02-01 | 1 | -0/+13 |
| | | | | | | | | It first computed the first i for q**(2**i) == 1, then checked that i was smaller than s. Given a composite modulus (for which the algorithm does not work), the loop might do a very large amount of work before returning the failure. | ||||
| * | Update for 1.11.24 release1.11.24 | Jack Lloyd | 2015-11-04 | 1 | -0/+11 |
| | | |||||
| * | 1.11.22 release1.11.22 | Jack Lloyd | 2015-10-26 | 1 | -4/+63 |
| | | |||||
| * | Add security notifications/advisory page to website. | Jack Lloyd | 2015-10-15 | 1 | -0/+51 |
| Based on GH #272 | |||||
 |
index : botan.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiffstats |