# Anubis (cipher)

Anubis | |

General | |
---|---|

Vincent Rijmen and Paulo S. L. M. Barreto | |

2000 | |

Rijndael | |

Cipher detail | |

Key size(s):| 128 to 320 bits in steps of 32 bits | |

Block size(s):| 128 bits | |

substitution-permutation network | |

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 32

*N*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.

## 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.Springer-Verlag&rft.place=Lund&rft.pages=pp.45%26ndash%3B53&rft_id=http%3A%2F%2Fciteseer.ist.psu.edu%2F587474.html">

## External links

**AES**

The

`SubBytes`step, one of four stages in a round of AESGeneral

Vincent Rijmen, Joan Daemen

1998

Square

Anubis, Grand Cru

AES winner, CRYPTREC, NESSIE

Cipher detail

Key size(s):| 128, 192 or 256 bits

^{[1]}

**.....**Click the link for more information.

In cryptography, the

**key size**(alternatively**key length**) is the size of the digits used to create an encrypted text; it is therefore also a measure of the number of possible keys which can be used in a cipher, and the number of keys which must be tested to 'break' the**.....**Click the link for more information.**block size**. Both the input (plaintext) and output (ciphertext) are the same length; the output cannot be shorter than the input — this is logically required by the Pigeonhole principle and the fact that the cipher must be invertible — and it is simply undesirable for

**.....**Click the link for more information.

**SP-network**, or

**substitution-permutation network**(

**SPN**), is a series of linked mathematical operations used in block cipher algorithms such as AES.

These networks consist of S-boxes and P-boxes that transform blocks of input bits into output bits.

**.....**Click the link for more information.

**block cipher**is a symmetric key cipher which operates on fixed-length groups of bits, termed

*blocks*, with an unvarying transformation. When encrypting, a block cipher might take a (for example) 128-bit block of plaintext as input, and output a corresponding 128-bit block

**.....**Click the link for more information.

**Vincent Rijmen**(born 16 October 1970, in Leuven, near Brussels, Belgium) is a Belgian cryptographer and one of the designers of the Rijndael, the Advanced Encryption Standard.

**.....**Click the link for more information.

**Paulo S. L. M. Barreto**(born 1965) is a Brazilian cryptographer and one of the designers of the Whirlpool hash function and the block ciphers Anubis and KHAZAD, together with Vincent Rijmen.

**.....**Click the link for more information.

For other uses, see nessie (disambiguation).

**NESSIE (New European Schemes for Signatures, Integrity and Encryption)**was a European research project funded from 2000–2003 to identify secure cryptographic primitives.

**.....**Click the link for more information.

**AES**

The

`SubBytes`step, one of four stages in a round of AESGeneral

Vincent Rijmen, Joan Daemen

1998

Square

Anubis, Grand Cru

AES winner, CRYPTREC, NESSIE

Cipher detail

Key size(s):| 128, 192 or 256 bits

^{[1]}

**.....**Click the link for more information.

**involution**, or an

**involutary function**, is a function that is its own inverse, so that

*f*(*f*(*x*)) =*x*for all*x*in the domain of*f*.

## General properties

Any involution is a bijection.**.....**Click the link for more information.

In cryptography, a

**substitution box**(or**S-box**) is a basic component of symmetric key algorithms. In block ciphers, they are typically used to obscure the relationship between the plaintext and the ciphertext — Shannon's property of confusion.**.....**Click the link for more information.**Editing of this page by unregistered or newly registered users is currently disabled due to vandalism.**

If you are prevented from editing this page, and you wish to make a change, please discuss changes on the talk page, request unprotection, log in, or .

**.....**Click the link for more information.

**encryption**is the process of transforming information (referred to as plaintext) to make it unreadable to anyone except those possessing special knowledge, usually referred to as a key.

**.....**Click the link for more information.

A

**curse**is the effective action of some power, distinguished solely by the quality of adversity that it brings. A curse may also be said to result from a spell or prayer, imprecation or execration, or other imposition by magic or witchcraft, asking that a god, natural force, or**.....**Click the link for more information.**Alex Biryukov**is a cryptographer, currently an assistant professor at the University of Luxembourg. His notable work includes the design of the stream cipher LEX, as well as the cryptanalysis of numerous cryptographic primitives.

**.....**Click the link for more information.

**Portable Document Format (PDF)**

Adobe Reader displaying a PDF in Microsoft Windows Vista

File extension:

`.pdf`

MIME type:

`application/pdf`

Type code:

`'PDF '`(including a single space)

**.....**Click the link for more information.

For the page description language, see .

A

**postscript**(from

*post scriptum*, a Latin expression meaning "after writing" and abbreviated P.S.

**.....**Click the link for more information.

**Fast Software Encryption**, often abbreviated

**FSE**, is a workshop for cryptography research, focussed on symmetric-key cryptography with an emphasis on fast, practical techniques, as opposed to theory.

**.....**Click the link for more information.

Lund

Lund

Lund Cathedral in Lund

**Coat of arms**

Location of Lund in northern Europe

Coordinates:

Country Sweden

Municipality

**.....**Click the link for more information.

**Springer Science+Business Media**or

**Springer**(IPA: [ˈʃpʁɪŋɐ]) is a worldwide publishing company based in Germany with major offices in Berlin, Heidelberg, Dordrecht (Netherlands) and New York,

**.....**Click the link for more information.

**Springer Science+Business Media**or

**Springer**(IPA: [ˈʃpʁɪŋɐ]) is a worldwide publishing company based in Germany with major offices in Berlin, Heidelberg, Dordrecht (Netherlands) and New York,

**.....**Click the link for more information.

Lund

Lund

Lund Cathedral in Lund

**Coat of arms**

Location of Lund in northern Europe

Coordinates:

Country Sweden

Municipality

**.....**Click the link for more information.

**block cipher**is a symmetric key cipher which operates on fixed-length groups of bits, termed

*blocks*, with an unvarying transformation. When encrypting, a block cipher might take a (for example) 128-bit block of plaintext as input, and output a corresponding 128-bit block

**.....**Click the link for more information.

**3-Way**

General

Joan Daemen

1994

NOEKEON

BaseKing

Cipher detail

Key size(s):| 96 bits

Block size(s):| 96 bits

Substitution-permutation network

11

Best public cryptanalysis|-| colspan=2 | related-key attack

In cryptography,

**.....**Click the link for more information.

**AES**

The

`SubBytes`step, one of four stages in a round of AESGeneral

Vincent Rijmen, Joan Daemen

1998

Square

Anubis, Grand Cru

AES winner, CRYPTREC, NESSIE

Cipher detail

Key size(s):| 128, 192 or 256 bits

^{[1]}

**.....**Click the link for more information.

**Akelarre**

General

G. Álvarez, D. de la Guía, F. Montoya, A. Peinado

1996

IDEA, RC5

Cipher detail

Key size(s):| 128 bits

Block size(s):| 128 bits

Substitution-permutation network

4

**.....**Click the link for more information.

**ARIA**

General

2003

AES

South Korean standard

Cipher detail

Key size(s):| 128, 192, or 256 bits

Block size(s):| 128 bits

Substitution-permutation network

12, 14, or 16

**.....**Click the link for more information.

**BaseKing**

General

Joan Daemen

1994

NOEKEON

3-Way

Cipher detail

Key size(s):| 192 bits

Block size(s):| 192 bits

Substitution-permutation network

11

Best public cryptanalysis|-| colspan=2 | related-key attack, power analysis

**.....**Click the link for more information.

**Blowfish**

The round function (Feistel function) of Blowfish

General

Bruce Schneier

1993

Twofish

Cipher detail

Key size(s):| 32-448 bits in steps of 8 bits; default 128 bits

Block size(s):| 64 bits

Feistel network

16

**.....**Click the link for more information.

**Cryptomeria cipher**

The Feistel function of the Cryptomeria cipher algorithm.

General

4C Entity

2003

DES

CSS

Cipher detail

Key size(s):| 56 bits

Block size(s):| 64 bits

Feistel network

10

The

**.....**Click the link for more information.

This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.