Re: IBM press release - encryption and authentication

[Nikita Borisov]

In article <[EMAIL PROTECTED]>,
Bram Cohen  <[EMAIL PROTECTED]> wrote:
>it's not hard to figure it out just from the slides - there are actually
>two methods given, one which requires an extra lg(n) encryptions and one
>which requires two extra encryptions but has a bunch of modular
>arithmetic. Rijndael is so fast I suspect the second one might not prove
>all that useful.

But in his examples, addition mod 2^128 - 159 can be implemented rather
quickly:

S_i = S_{i-1} + b [regular 128-bit addition]
if (b > S_i) S_i += 159

- Nikita