| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | bit_ops.h no longer includes loadstor.h | lloyd | 2007-10-19 | 1 | -0/+1 |
| | | | | | | | | | | Where loadstor.h was needed but only implicitly included via bit_ops.h, include it directly Add endian reversal functions to bit_ops.h Remove some unneeded includes in big_ops2.cpp and a few other files. | ||||
| * | Make some formatting between the encryption and decryption code equivalent. | lloyd | 2007-10-15 | 1 | -1/+4 |
| | | |||||
| * | Write functions to handle loading and saving words a block at a time, taking ↵ | lloyd | 2007-05-31 | 1 | -29/+14 |
| | | | | | | | | | | | | | | | | | | | into account endian differences. The current code does not take advantage of the knowledge of which endianness we are running on; an optimization suggested by Yves Jerschow is to use (unsafe) casts to speed up the load/store operations. This turns out to provide large performance increases (30% or more) in some cases. Even without the unsafe casts, this version seems to average a few percent faster, probably because the longer loading loops have been partially or fully unrolled. This also makes the code implementing low-level algorithms like ciphers and hashes a bit more succint. | ||||
| * | Bump copyright year to 2007 | lloyd | 2007-01-20 | 1 | -1/+1 |
| | | |||||
| * | Initial checkin1.5.6 | lloyd | 2006-05-18 | 1 | -0/+227 |
 |
index : botan.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiffstats |