[PATCH] sha3sum: New applet, v4

[Lauri Kasanen]

> Yes, from two ways: SHA-3 as an algorithm is 2-3x slower than md5, and
> the implementation here is optimized for size.
> 
> There exist faster implementations, but bb usually wants the smallest
> size.
> 
> 
> Another point is that on big-endian it now flips to little-endian and
> back to get correct results. This is how the upstream Keccak examples
> all do it, and I couldn't get correct results on BE otherwise. The speed
> should be better on little-endian systems.

On x86_64 it's about 5x slower than bb sha1sum here, which is within the
target (2-3x plus size vs speed).

- Lauri

-- 
http://www.fastmail.fm - Or how I learned to stop worrying and
                          love email again