[PATCH 2/2] Avoid slow integer multiplication and division with blocksize calculations.

Werner Koch wk at gnupg.org
Thu Nov 29 19:00:11 CET 2012

On Thu, 29 Nov 2012 16:37, jussi.kivilinna at mbnet.fi said:

> Currently all blocksizes are powers of two (and most likely in future), so we
> can avoid using integer multiplication and division/modulo operations (that
> are slow on architechtures without hardware units for mul/div/mod).

Do you have some of your cool benchmarks?



Die Gedanken sind frei.  Ausnahmen regelt ein Bundesgesetz.

More information about the Gcrypt-devel mailing list