Anubis (cipher)
From Wikipedia, the free encyclopedia
| Anubis | |
| General | |
|---|---|
| Designers | Vincent Rijmen and Paulo S. L. M. Barreto |
| First published | 2000 |
| Derived from | Rijndael |
| Cipher detail | |
| Key sizes | 128 to 320 bits in steps of 32 bits |
| Block sizes | 128 bits |
| Structure | substitution-permutation network |
| Rounds | at least 12 (for 128-bit keys), plus one per additional 32 key bits |
Anubis is a block cipher designed by Vincent Rijmen and Paulo S. L. M. Barreto as an entrant in the NESSIE project. Anubis operates on data blocks of 128 bits, accepting keys of length 32N bits (N = 4, ..., 10). The cipher is not patented and has been released by the designers for free public use.
Anubis is a Rijndael variant that uses involutions for the various operations. An involution is an operation whose inverse is the same as the forward operation. In other words, when an involution is run twice, it is the same as performing no operation. This allows low-cost hardware and compact software implementations to use the same operations for both encryption and decryption. Both the S-box and the mix columns operations are involutions.
There are two versions of the Anubis cipher; the original implementation uses a pseudo-random S-box. Subsequently, the S-box was modified to be more efficient to implement in hardware; the newer version of Anubis is called the "tweaked" version.
It is named after the Egyptian god of entombing and embalming, which the designers interpreted to include encryption. They claim that violators of the cipher will be cursed.
[edit] References
- Alex Biryukov (February 2003). "Analysis of Involutional Ciphers: Khazad And Anubis" (PDF/PostScript). 10th International Workshop on Fast Software Encryption (FSE '03): pp.45–53, Lund: Springer-Verlag. Retrieved on 2007-08-21.
[edit] External links
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
