Re: Self-shrinking MT19937 as stream cipher
- From: Mike Amling <nospam@xxxxxxxxxx>
- Date: 28 Sep 2006 11:45:23 EDT
Cristiano wrote:
The Berlekamp-Massey algorithm shows that the linear complexity of any bit of the MT19937 is 19937, this means that taking the LSB of MT19937 is equivalent to use a 19937-bit LFSR (also see a recent post on sci.crypt.random-numbers).
In the paper "The Self-Shrinking Generator", Meier and Staffelbach showed that the complexity of the attack for an N-bit self-shrinking LFSR is O(2^(0.69*N)).
Using the LSB of MT19937 to get a self-shrinking generator, we get an attack complexity of O(2^13757) which seems much bigger than the one of any stream cipher.
Why don't use an MT19937 based self-shrinking generator as a stream cipher?
"Why not use ..." or "Why don't we use..." (Hi, Cristiano!)
IIRC, it uses more RAM than other stream ciphers. It wouldn't have a built-in MAC like Phelix. Unlike VMPC, it can't be implemented with a pack of cards. How's its speed? Could it have unexpected vulnerabilities, like RC4?
--Mike Amling
.
- Follow-Ups:
- Re: Self-shrinking MT19937 as stream cipher
- From: Cristiano
- Re: Self-shrinking MT19937 as stream cipher
- References:
- Self-shrinking MT19937 as stream cipher
- From: Cristiano
- Self-shrinking MT19937 as stream cipher
- Prev by Date: Re: Self-shrinking MT19937 as stream cipher
- Next by Date: Re: Need Graph Isomorphism Algorithm De-bunked
- Previous by thread: Re: Self-shrinking MT19937 as stream cipher
- Next by thread: Re: Self-shrinking MT19937 as stream cipher
- Index(es):
Relevant Pages
|
|