if this is RC4

Jim Gillogly jim at acm.org
Sat Sep 17 09:44:38 PDT 1994



> rarachel at prism.poly.edu (Arsen Ray Arachelian) writes:
> > One possibility is that the author may have simply decompiled the
> > original code...

> This might explain the char % 255's in the code.  Normally such a 
...
> may surprise some of us that some machines can do a MOD faster than
> an AND and the compiler used might have exploited that feature.

It wouldn't explain the construct Hal pointed out, though:

>         xorIndex = state[x] + (state[y]) % 256;

Here it's either a bug or a no-op, so a decompiler wouldn't have produced it.

	Jim Gillogly
	26 Halimath S.R. 1994, 16:43






More information about the cypherpunks-legacy mailing list