LEVIATHAN's tree-based keystream generation
LEVIATHAN is a stream cipher submitted to NESSIE by Scott Fluhrer and David McGrew. It is a seekable stream cipher, which means that the user may efficiently skip forward to any part of the keystream, much like CTR mode or Salsa20, but unlike those ciphers generating contiguous blocks of the keystream is made especially efficient by LEVIATHAN's unique tree structure based stream generation. LEVIATHAN achieves around 11 cycles/byte on a Pentium II processor.
LEVIATHAN is considered broken due to distinguishing attacks which require 236 bytes of output and comparable effort.[1]
External links
- LEVIATHAN specification (ZIP file)
References
- ^ Crowley, P.; Lucks, S. (April 2001). "Bias in the LEVIATHAN stream cipher". Fast Software Encryption: 8th International Workshop (Lecture Notes in Computer Science), Yokohama, Japan: Springer-Verlag. Retrieved on 2006-11-13.
| Algorithms: A5/1 | A5/2 | E0 | FISH | Grain | HC-256 | ISAAC | MUGI | Panama | Phelix | Pike | Py | Rabbit | RC4 | Salsa20 | Scream | SEAL | SOBER | SOBER-128 | SOSEMANUK | Trivium | WAKE |
| Theory: Shift register | LFSR | NLFSR | Shrinking generator | T-function | IV Standardization: eSTREAM |
| History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography |
| Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers |
