aboutsummaryrefslogtreecommitdiffstats
path: root/src/des.cpp
Commit message (Collapse)AuthorAgeFilesLines
* Where bit_ops.h was used to get xor_buf, include xor_buf.h insteadlloyd2008-09-021-1/+1
|
* Change the copyrights in all files in the Botan tree to directly reflectlloyd2008-04-101-1/+1
| | | | | | the actual copyright holders. For rationale, see my post to botan-devel on April 9, subject 'Changing license to directly reflect contributors' (http://www.randombit.net/pipermail/botan-devel/2008-April/000527.html)
* Mostly revert 2f4fd18182d5a75c40cd831e7ee3c314be5c57d6, only keep thelloyd2008-03-101-1/+1
| | | | | updated dates on files that have actually changed this year. This makes the diff across versions readable again.
* Mass update of the copyright date. Honestly I don't know why I bother,lloyd2008-02-141-1/+1
| | | | | | | but might as well keep it up to date. And it's easier to do it once with a 'perl -pi' command than to update each file over time. Apologies to anyone looking at diffs.
* bit_ops.h no longer includes loadstor.hlloyd2007-10-191-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.
* Avoid C-style casts (as detected by GCC's -Wold-style-cast) and instead use lloyd2007-07-231-4/+4
| | | | static_cast or reinterpret_cast, as needed.
* Write functions to handle loading and saving words a block at a time, taking ↵lloyd2007-05-311-24/+8
| | | | | | | | | | | | | | | | | | 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 2007lloyd2007-01-201-1/+1
|
* Initial checkin1.5.6lloyd2006-05-181-0/+274