claim: The Quiet was released in May of 2005.
evidence: Grøstl is a cryptographic hash function submitted to the NIST hash function competition by Praveen Gauravaram , Lars Knudsen , Krystian Matusiewicz , Florian Mendel , Christian Rechberger , Martin Schlaffer , and Søren S. Thomsen .. Praveen Gauravaram. Praveen Gauravaram. Lars Knudsen. Lars Knudsen. Krystian Matusiewicz. Krystian Matusiewicz. Florian Mendel. Florian Mendel. Christian Rechberger. Christian Rechberger. Martin Schlaffer. Martin Schlaffer. Søren S. Thomsen. Søren S. Thomsen. cryptographic hash function. cryptographic hash function. NIST hash function competition. NIST hash function competition. Grøstl was chosen as one of the five finalists of the competition .. It uses the same S-box as AES in a custom construction .. AES. Advanced Encryption Standard. S-box. S-box. The authors claim speeds of up to 21.4 cycles per byte on an Intel Core 2 Duo .. Core 2. Core 2. cycles per byte. cycles per byte. Intel Core 2 Duo. Intel Core 2. According to the submission document , the name `` Grøstl '' is a multilingual play-on-words , referring to an Austrian dish that is very similar to hash -LRB- food -RRB- .. Like other hash functions in the MD5 / SHA family , Grøstl divides the input into blocks and iteratively computes hi = f -LRB- hi − 1 , mi -RRB- .. However , Grøstl maintains a hash state at least twice the size of the final output -LRB- 512 or 1024 bits -RRB- , which is only truncated at the end of hash computation .. The compression function f is based on a pair of 256 - or 512-bit permutation functions P and Q , and is defined as  :. f -LRB- h , m -RRB- = P -LRB- h ⊕ m -RRB- ⊕ Q -LRB- m -RRB- ⊕ h. The permutation functions P and Q are heavily based on the Rijndael -LRB- AES -RRB- block cipher , but operate on 8 × 8 or 8 × 16 arrays of bytes , rather than 4 × 4 .. AES. Advanced Encryption Standard. Rijndael. Rijndael. Like AES , each round consists of four operations  :. AES. Advanced Encryption Standard. AddRoundKey -LRB- the Grøstl round keys are fixed , but differ between P and Q -RRB-. SubBytes -LRB- this uses the Rijndael S-box , allowing sharing with AES implementations -RRB-. AES. Advanced Encryption Standard. S-box. S-box. Rijndael. Rijndael. ShiftBytes -LRB- expanded compared to AES , this also differs between P and Q , and 512 - and 1024-bit versions -RRB-. AES. Advanced Encryption Standard. MixColumns -LRB- using an 8 × 8 matrix rather than Rijndael 's 4 × 4 -RRB-. Rijndael. Rijndael. Unlike Rijndael , all rounds are identical and there is no final AddRoundKey operation .. Rijndael. Rijndael. 10 rounds are recommended for the 512-bit permutation , and 14 rounds for the 1024-bit version .. The final double-width hash receives a final output transformation of. Ω -LRB- h -RRB- = h ⊕ P -LRB- h -RRB-. and is then truncated to the desired width .. This is equivalent to applying a final iteration of the compression function using an all-zero message block m , followed by a -LRB- cryptographically insignificant -RRB- exclusive-or with the fixed constant Q -LRB- 0 -RRB- .