Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Fix for minimized builds | Jack Lloyd | 2015-08-21 | 1 | -0/+1 |
| | |||||
* | Missing add | Jack Lloyd | 2015-08-21 | 1 | -0/+1 |
| | |||||
* | Bump version | Jack Lloyd | 2015-08-21 | 2 | -1/+7 |
| | |||||
* | In RSA, check that the input is less than the modulus n before blinding | Jack Lloyd | 2015-08-21 | 1 | -5/+7 |
| | | | | | | | | | | | | | rather than after. After blinding the value is always reduced mod n so the condition is never met. This may be the cause of RSA test failures described in GH #174 The scenario was that during randomized corruption tests we occasionally provide an input which was greater than the modulus. When that happened the value was effectively reduced mod n, so the self-check would later fail, because the decrypted result (reduced mod n) would be compared with the original (larger than n) input. | ||||
* | Add power analysis countermeasures for ECC point multiplications. | Jack Lloyd | 2015-08-21 | 10 | -242/+411 |
| | | | | | | | | The plain PointGFp operator* now uses Montgomery ladder exclusively. Adds a blinded point multiply algorithm which uses exponent and point randomization, as well as a Montgomery ladder technique that takes a random walk of the possible addition chains for k. | ||||
* | Merge pull request #258 from webmaster128/reactivate-ffi-test | Simon Warta | 2015-08-21 | 1 | -3/+2 |
|\ | | | | | Reactivate FFI PBKDF minimum iterations test | ||||
| * | Reactivate FFI PBKDF minimum iterations test | Simon Warta | 2015-08-21 | 1 | -3/+2 |
|/ | | | | | as dicussed here: https://github.com/randombit/botan/commit/480999c2820b0da995108d7474a74755cafd2924 | ||||
* | Merge pull request #257 from webmaster128/variable-name-m_core | Simon Warta | 2015-08-21 | 2 | -23/+23 |
|\ | | | | | Add m_ prefix to member variable Power_Mod::m_core | ||||
| * | Add m_ prefix to member variable Power_Mod::m_core | Simon Warta | 2015-08-21 | 2 | -23/+23 |
|/ | |||||
* | Merge pull request #253 from webmaster128/random_prime_speed | Simon Warta | 2015-08-21 | 10 | -101/+245 |
|\ | | | | | Refactor ./botan speed | ||||
| * | Refactor ./botan speed | Simon Warta | 2015-08-21 | 10 | -101/+245 |
|/ | | | | | | | * Add random_prime benchmark * Add is_prime benchmark * Respect runtime in benchmark_transform(). This sets default runtime from 2s to 0.5s per configuration | ||||
* | Merge pull request #254 from webmaster128/circleci | Simon Warta | 2015-08-21 | 6 | -0/+63 |
|\ | | | | | Add initial cirlce config | ||||
| * | Add initial cirlce config | Simon Warta | 2015-08-21 | 6 | -0/+63 |
|/ | |||||
* | Merge pull request #251 from webmaster128/clang-debug-solink | Simon Warta | 2015-08-14 | 1 | -3/+5 |
|\ | | | | | Add so_link_command for clang debug on darwin and default | ||||
| * | Add so_link_command for clang debug on darwin and default | Simon Warta | 2015-08-14 | 1 | -3/+5 |
|/ | | | | Fixes #250 | ||||
* | Merge pull request #249 from webmaster128/c-function-must-not-throw | Simon Warta | 2015-08-14 | 16 | -61/+3 |
|\ | | | | | Remove all 'extern "C"' from src/lib/math/mp/ | ||||
| * | Remove 'extern "C"' from src/lib/math/mp | Simon Warta | 2015-08-14 | 16 | -61/+3 |
|/ | | | | | | | | | | C functions must not throw but Botan::bigint_divop throws (MSVC: warning C4297: 'Botan::bigint_divop' : function assumed not to throw an exception but does) * Move bigint_mul -> Botan::bigint_sqr * Move bigint_sqr -> Botan::bigint_sqr * Variable in unnamed namespace supersedes "static" keyword | ||||
* | Merge pull request #248 from webmaster128/check-msvc-cl-version | Simon Warta | 2015-08-12 | 1 | -2/+7 |
|\ | | | | | Update Appveyor config | ||||
| * | Update Appveyor config | Simon Warta | 2015-08-12 | 1 | -2/+7 |
|/ | |||||
* | Merge pull request #240 from webmaster128/X509_Time-constructor | Simon Warta | 2015-08-11 | 10 | -250/+363 |
|\ | | | | | Remove string constructor of X509_Time() | ||||
| * | Add stricter time parsing; Add more tests | Simon Warta | 2015-08-11 | 3 | -9/+113 |
| | | |||||
| * | Sometimes we don't know the input format. But it is one of two | Simon Warta | 2015-08-11 | 5 | -9/+28 |
| | | |||||
| * | Explicitly fwd declase classes BER_Decoder, DER_Encoder | Simon Warta | 2015-08-11 | 3 | -12/+10 |
| | | |||||
| * | Test implicit X509_Time copy constructor and assignment | Simon Warta | 2015-08-11 | 1 | -0/+17 |
| | | |||||
| * | Add Not matcher for Catch | Simon Warta | 2015-08-11 | 1 | -0/+24 |
| | | |||||
| * | Minor refactoring of existing Matchers | Simon Warta | 2015-08-11 | 1 | -7/+10 |
| | | |||||
| * | Remove string constructor of X509_Time() | Simon Warta | 2015-08-11 | 7 | -228/+176 |
|/ | | | | | | | | | | | * Break down string representations to to_string() and readable_string() * Add m_ prefix to member variable names * Fix order of methods * Move comments Doxygen friendly to header * Make set_to() private (future subjejt of refectoring); People should use constructor Closes #185 | ||||
* | Merge pull request #245 from webmaster128/refactor-test-style | Simon Warta | 2015-08-11 | 1 | -82/+64 |
|\ | | | | | Refector tests style (use matchers) | ||||
| * | Refector tests style (use matchers) | Simon Warta | 2015-08-11 | 1 | -82/+64 |
|/ | |||||
* | Merge pull request #244 from webmaster128/stict-uint32-parsing | Simon Warta | 2015-08-11 | 2 | -7/+20 |
|\ | | | | | Strict uint32 parsing | ||||
| * | Strict uint32 parsing | Simon Warta | 2015-08-11 | 2 | -7/+20 |
|/ | |||||
* | Merge pull request #243 from webmaster128/avoid-uint32-overflow | Simon Warta | 2015-08-11 | 2 | -3/+58 |
|\ | | | | | Avoid integer overlow in string->uint32 converter | ||||
| * | Avoid integer overlow in string->uint32 converter | Simon Warta | 2015-08-10 | 2 | -3/+58 |
|/ | | | | | | | On systems where unsigned long is uint64 (typically 64 bit systems), a string containing a number greater than 2^32-1 was sucessfully converted to a uint64 and than reduced to uint32, causing an overflow. E.g. to_u32bit("4294967296") was 0 and to_u32bit("4294967297") was 1. | ||||
* | Merge pull request #242 from webmaster128/deactivate-failing-iterations-test | Simon Warta | 2015-08-09 | 1 | -0/+8 |
|\ | | | | | Deactivate tests that consistently fail in debug mode | ||||
| * | Deactivate tests that consistently fail in debug mode | Simon Warta | 2015-08-09 | 1 | -0/+8 |
|/ | | | | [ci skip] | ||||
* | Restrict input values to NIST reductions to defined range | Jack Lloyd | 2015-08-08 | 1 | -3/+13 |
| | |||||
* | Ignore emacs backups | Jack Lloyd | 2015-08-08 | 1 | -0/+2 |
| | |||||
* | Merge branch 'master' of https://github.com/randombit/botan | Jack Lloyd | 2015-08-08 | 13 | -267/+434 |
|\ | |||||
| * | Merge pull request #239 from webmaster128/rename-member-vars | Simon Warta | 2015-08-08 | 2 | -27/+28 |
| |\ | | | | | | | Add m_ prefix to member variables in SecureQueue | ||||
| | * | Add m_ prefix to member variables in SecureQueue | Simon Warta | 2015-08-08 | 2 | -27/+28 |
| |/ | |||||
| * | Merge pull request #235 from tiwoc/overrides | Simon Warta | 2015-08-08 | 2 | -2/+2 |
| |\ | | | | | | | Add two missing overrides and fix bug in fuzzer relating to these | ||||
| | * | Add override and fix signature of Fuzzer_Creds::psk_identity() | Daniel Seither | 2015-08-03 | 1 | -1/+1 |
| | | | |||||
| | * | Add missing override for SecureQueue::check_available() | Daniel Seither | 2015-08-03 | 1 | -1/+1 |
| | | | |||||
| * | | Merge pull request #238 from webmaster128/fuzzer | Simon Warta | 2015-08-08 | 1 | -2/+2 |
| |\ \ | | | | | | | | | Rename fuzzer test consistently | ||||
| | * | | Rename fuzzer test consistently | Simon Warta | 2015-08-08 | 1 | -2/+2 |
| |/ / | | | | | | | | | | Align filename with test_fuzzer() | ||||
| * | | Merge pull request #208 from webmaster128/go-for-matchers | Simon Warta | 2015-08-08 | 9 | -236/+402 |
| |\ \ | | | | | | | | | Refactor catchy tests | ||||
| | * | | Refactor most of FFI test for matchers | Simon Warta | 2015-08-08 | 1 | -103/+149 |
| | | | | |||||
| | * | | Add matchers for integers and bool | Simon Warta | 2015-08-08 | 2 | -26/+73 |
| | | | | |||||
| | * | | Refactor catchy tests | Simon Warta | 2015-08-08 | 8 | -107/+180 |
| |/ / | | | | | | | | | | | | | | | | | | | | | | * Add std::vector matcher * Add test_base to ensure Botan::vector<X> works with matcher * Rewrite base64 tests from CHECK( to CHECK_THAT( Closes #206 | ||||
* / / | Expose the NIST prime values and reduction operations as plain functions. | Jack Lloyd | 2015-08-08 | 7 | -285/+367 |
|/ / | | | | | | | | | | | Previously they were hidden away as private functions on the CurveGFp types. This allows directly testing the reduction functions against other computational methods. |