[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 the modulo from rotBitcount in Julia. It made little difference 
to the time, and the parallel rotBitcount even got longer (times are in 
nanoseconds):

julia> WringTwistree.wringTime(5000)
2.8920525e6 #with mod
julia> WringTwistree.wringTime(5000)
2.7080365e6 #without mod

julia> WringTwistree.wringTime(6000)
3.337618e6 #with mod
julia> WringTwistree.wringTime(6000)
3.588009e6 #without mod

It switches to parallel at message length 5589; I think I'll have to recompute 
that. I'll also have to make the breakeven point depend on the number of 
threads.

Pierre
-- 
ve ka'a ro klaji la .romas. se jmaji