Keccak

Keccak is a family of sponge functions. The sponge function is a generalization of the concept of cryptographic hash function with infinite output and can perform quasi all symmetric cryptographic functions, from hashing to pseudo-random number generation to authenticated encryption. For a quick introduction, we propose a pseudo-code description of Keccak. The reference specification, analysis, reference and optimized code and test vectors for Keccak can be found in the file section. As primitive used in the sponge construction, the Keccak instances call one of seven permutations named Keccak-f[b], with b=25, 50, 100, 200, 400, 800 or 1600. In the scope of the SHA-3 contest, we proposed the largest permutation, namely Keccak-f[1600], but smaller (or more “lightweight”) permutations can be used in constrained environments. Each permutation consists of the iteration of a simple round function, similar to a block cipher without a key schedule. The choice of operations is limited to bitwise XOR, AND and NOT and rotations. There is no need for table-lookups, arithmetic operations, or data-dependent rotations. Keccak has a very different design philosophy from its predecessor RadioGatún. This is detailed in our paper presented at Dagstuhl in 2009.


References in zbMATH (referenced in 25 articles , 1 standard article )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Fay, Robin: Introducing the counter mode of operation to compressed sensing based encryption (2016)
  2. Landelle, Franck; Peyrin, Thomas: Cryptanalysis of full RIPEMD-128 (2016)
  3. Andreeva, Elena; Mennink, Bart; Preneel, Bart: Open problems in hash function security (2015)
  4. Bilgin, Begül; Nikova, Svetla; Nikov, Ventzislav; Rijmen, Vincent; Tokareva, Natalia; Vitkup, Valeriya: Threshold implementations of small S-boxes (2015)
  5. Blondeau, Céline; Nyberg, Kaisa: Perfect nonlinear functions and cryptography (2015)
  6. Dinur, Itai; Morawiecki, Paweł; Pieprzyk, Josef; Srebrny, Marian; Straus, Michał: Cube attacks and cube-attack-like cryptanalysis on the round-reduced Keccak sponge function (2015)
  7. Dobraunig, Christoph; Eichlseder, Maria; Mendel, Florian; Schläffer, Martin: Cryptanalysis of Ascon (2015)
  8. Gaži, Peter; Pietrzak, Krzysztof; Tessaro, Stefano: The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC (2015)
  9. Haitner, Iftach; Ishai, Yuval; Omri, Eran; Shaltiel, Ronen: Parallel hashing via List recoverability (2015)
  10. Peyrin, Thomas: Collision attack on $ Grindahl$ (2015)
  11. Tan, Xiao; Huang, Qiong; Wong, Duncan S.: Concurrent signature without random oracles (2015)
  12. Dinur, Itai; Dunkelman, Orr; Shamir, Adi: Improved practical attacks on round-reduced Keccak (2014)
  13. Khovratovich, Dmitry; Nikolić, Ivica; Rechberger, Christian: Rotational rebound attacks on reduced Skein (2014)
  14. Saarinen, Markku-Juhani O.: CBEAM: efficient authenticated encryption from feebly one-way $\varphi $ functions (2014)
  15. Andreeva, Elena; Bogdanov, Andrey; Dodis, Yevgeniy; Mennink, Bart; Steinberger, John P.: On the indifferentiability of key-alternating ciphers (2013)
  16. Andreeva, Elena; Luykx, Atul; Mennink, Bart: Provable security of BLAKE with non-ideal compression function (2013)
  17. Aumasson, Jean-Philippe; Henzen, Luca; Meier, Willi; Naya-Plasencia, María: Quark: a lightweight hash (2013)
  18. Bertoni, Guido; Daemen, Joan; Peeters, Michaël; Van Assche, Gilles: Keccak (2013)
  19. Morawiecki, Paweł; Srebrny, Marian: A SAT-based preimage analysis of reduced Keccak hash functions (2013)
  20. Rijmen, Vincent: Extracts from the SHA-3 competition (2013)

1 2 next