Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | crypto-factory: Only sort RNGs by algorithm identifier | Tobias Brunner | 2014-06-20 | 1 | -5/+13 |
| | | | | | Others remain in the order in which they were added, grouped by algorithm identifier and sorted by benchmarking speed, if provided. | ||||
* | aead: Support custom AEAD salt sizes | Martin Willi | 2014-03-31 | 1 | -5/+5 |
| | | | | | | | | | The salt, or often called implicit nonce, varies between AEAD algorithms and their use in protocols. For IKE and ESP, GCM uses 4 bytes, while CCM uses 3 bytes. With TLS, however, AEAD mode uses 4 bytes for both GCM and CCM. Our GCM backends currently support 4 bytes and CCM 3 bytes only. This is fine until we go for CCM mode support in TLS, which requires 4 byte nonces. | ||||
* | unit-tests: Actually verify registered algorithms against test vectors | Tobias Brunner | 2014-03-20 | 1 | -1/+38 |
| | | | | | | | | Previously, the {ns}.crypto_test.on_add option had to be enabled to actually test the algorithms, which we can't enforce for the tests in the test_runner as the option is already read when the crypto factory is initialized. Even so, we wouldn't want to do this for every unit test, which would be the result of enabling that option. | ||||
* | lib: All settings use configured namespace | Tobias Brunner | 2014-02-12 | 1 | -3/+3 |
| | |||||
* | Revert refactoring which broke CentOS build | Andreas Steffen | 2013-10-13 | 1 | -1/+1 |
| | |||||
* | crypto-factory: Try next available RNG implementation if constructor fails | Tobias Brunner | 2013-10-11 | 1 | -13/+6 |
| | |||||
* | crypto-factory: Order entries by algorithm identifier and (optionally) speed | Tobias Brunner | 2013-10-11 | 1 | -22/+18 |
| | |||||
* | Remove HASH_PREFERRED, usages are replaced with HASH_SHA1, which is required ↵ | Tobias Brunner | 2013-10-11 | 1 | -2/+2 |
| | | | | for IKEv2 anyway | ||||
* | crypto-factory: count the number of test vector failures during registration | Martin Willi | 2013-06-21 | 1 | -16/+47 |
| | |||||
* | Moved debug.[ch] to utils folder | Tobias Brunner | 2012-10-24 | 1 | -1/+1 |
| | |||||
* | Moved data structures to new collections subfolder | Tobias Brunner | 2012-10-24 | 1 | -1/+1 |
| | |||||
* | Initialize g and p in create_dh factory method | Tobias Brunner | 2012-09-28 | 1 | -1/+1 |
| | |||||
* | Move MODP_CUSTOM va_arg fetching out of loop | Martin Willi | 2012-08-02 | 1 | -15/+11 |
| | | | | It seems problematic at least on PPC with gcc 4.3, fixes #208. | ||||
* | Enumerate correct list while removing nonce_gens, fix deregistration | Martin Willi | 2012-05-21 | 1 | -1/+1 |
| | |||||
* | Add enumerator for registered nonce generators. | Tobias Brunner | 2012-05-18 | 1 | -2/+19 |
| | |||||
* | Add nonce generator interface | Adrian-Ken Rueegsegger | 2012-05-18 | 1 | -0/+57 |
| | | | | | | | Nonce generators (nonce_gen_t) can be used to get or allocate nonces. Users can request nonce generators from the crypto factory while nonce plugins register/remove themselves to/from the crypto factory. | ||||
* | trace back crypto algorithms to the plugins that registered them | Andreas Steffen | 2010-12-18 | 1 | -41/+92 |
| | |||||
* | Added a MODP_CUSTOM DH group which takes g and p as constructor arguments | Martin Willi | 2010-09-02 | 1 | -2/+16 |
| | |||||
* | Added support for AEAD algorithms to crypto factory | Martin Willi | 2010-08-19 | 1 | -0/+86 |
| | |||||
* | Do not free registered algorithms, plugins are responsible for unregistering | Martin Willi | 2010-08-16 | 1 | -6/+6 |
| | |||||
* | Implemented algorithm benchmarking during registration | Martin Willi | 2010-08-16 | 1 | -53/+88 |
| | |||||
* | Migrated crypto_factory to INIT/METHOD macros | Martin Willi | 2010-08-16 | 1 | -156/+100 |
| | |||||
* | Adding DBG_LIB to all calls of libstrongswan's version of DBG*. | Tobias Brunner | 2010-04-06 | 1 | -1/+1 |
| | |||||
* | Separated the public interfaces of the threading primitives. | Tobias Brunner | 2009-12-23 | 1 | -1/+1 |
| | |||||
* | Moved mutex.c to a separate folder in order to cleanly wrap other threading ↵ | Tobias Brunner | 2009-12-23 | 1 | -1/+1 |
| | | | | primitives (and utils/mutex.h is now threading.h). | ||||
* | replaces four spaces by tabs, where appropriate | Martin Willi | 2009-09-04 | 1 | -1/+1 |
| | |||||
* | removed trailing spaces ([[:space:]]+$) | Martin Willi | 2009-09-04 | 1 | -29/+29 |
| | |||||
* | OpenSolaris defines MUTEX_DEFAULT therefore we rename the members of the ↵ | Tobias Brunner | 2009-08-14 | 1 | -1/+1 |
| | | | | enums mutex/condvar/rwlock_type_t. | ||||
* | removed one hierarchy level for crypto test options | Martin Willi | 2009-06-16 | 1 | -2/+2 |
| | |||||
* | make use of the crypto_tester in the crypto_factory | Martin Willi | 2009-06-11 | 1 | -40/+136 |
| | | | | | libstrongswan.crypto.test.on_add to test algorithms during initialization libstrongswan.crypto.test.on_create to test algorithms on each instantiation | ||||
* | removing svn keyword $Id$ from all files | Tobias Brunner | 2009-04-30 | 1 | -2/+0 |
| | |||||
* | use read-write locks in crypto factory for parallelization | Martin Willi | 2008-11-05 | 1 | -42/+42 |
| | |||||
* | crypto_factory algorithm enumeration API | Martin Willi | 2008-08-28 | 1 | -93/+186 |
| | | | | implementation of "ipsec listalgs" | ||||
* | added API for random number generators, served through credential factory | Martin Willi | 2008-04-15 | 1 | -1/+89 |
| | | | | ported randomizer_t to a rng_t on top of /dev/(u)random (plugin random) | ||||
* | merged the modularization branch (credentials) back to trunk | Martin Willi | 2008-03-13 | 1 | -0/+483 |