[EMAIL PROTECTED] writes: > Why does it need to be strictly non repeating?
For applications like block numbers in protocols, it is highly desirable to avoid overlap for as long as possible. I've noted to others on this before that for an application like the IP fragmentation id, it might be even better if no repeats occurred in any block of 2^31 (n being 32) but the sequence did not repeat itself (or at least could be harmlessly reseeded at very very long intervals). However, doing that might be even harder than producing a more standard ergodic sequence... > Is 2^n always large enough that sequences of length > 2^n are > uninteresting? I don't understand the question. > If sequences longer than 2^n are practical and *every* subsequence > of 2^n elements is free of duplicates the entire thing is periodic, > this may or may not be a problem... Re-keying is of course an option, but I'll admit that produces problems of its own. -- Perry E. Metzger [EMAIL PROTECTED] --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]