[Cryptography] Cryptanalyzing a whole-message cipher and a double-tree hash function

[Pierre Abbat]

On Tuesday, December 26, 2023 5:41:39 AM EST Jacob Christian Munch-Andersen 
wrote:
> it is just a rotation, but you manage to call modulo with a variable divider
> twice per byte processed.

I just removed mod from the loops in Rust, and it's half faster than it was 
before.

I may do the same to the Haskell code in the future, but not now. The ST 
version, though it's faster than the purely functional version, is slowed down 
by the ST monad, so removing the modulo operator from the loop wouldn't speed 
it up noticeably, unless maybe it's compiled with no multithreading.

Pierre
-- 
Por H o por B, los campos magnéticos se difieren dentro de un imán.