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 49 articles , 1 standard article )

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

1 2 3 next

  1. Qiao, Kexin; Song, Ling; Liu, Meicheng; Guo, Jian: New collision attacks on round-reduced keccak (2017)
  2. Renes, Joost; Smith, Benjamin: qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs (2017)
  3. Wu, Teng; Tan, Yin; Mandal, Kalikinkar; Gong, Guang: On the multi-output filtering model and its applications (2017)
  4. Abed, Farzaneh; Forler, Christian; Lucks, Stefan: General classification of the authenticated encryption schemes for the CAESAR competition (2016)
  5. Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco: Exploring energy efficiency of lightweight block ciphers (2016)
  6. Beierle, Christof: Pen and paper arguments for SIMON and SIMON-like designs (2016)
  7. Beierle, Christof; Kranz, Thorsten; Leander, Gregor: Lightweight multiplication in $\mathrmGF(2^n)$ with applications to MDS matrices (2016)
  8. Boneh, Dan; Corrigan-Gibbs, Henry; Schechter, Stuart: Balloon hashing: a memory-hard function providing provable protection against sequential attacks (2016)
  9. Buchmann, Johannes A.; Butin, Denis; Göpfert, Florian; Petzoldt, Albrecht: Post-quantum cryptography: state of the art (2016)
  10. Canteaut, Anne; Duval, Sébastien; Leurent, Gaëtan: Construction of lightweight S-boxes using Feistel and MISTY structures (2016)
  11. Chen, Ming-Shing; Hülsing, Andreas; Rijneveld, Joost; Samardjiska, Simona; Schwabe, Peter: From 5-pass $\mathcal MQ$-based identification to $\mathcal MQ$-based signatures (2016)
  12. Fay, Robin: Introducing the counter mode of operation to compressed sensing based encryption (2016)
  13. Forler, Christian; List, Eik; Lucks, Stefan; Wenzel, Jakob: Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch (2016)
  14. Guo, Jian; Liu, Meicheng; Song, Ling: Linear structures: applications to cryptanalysis of round-reduced keccak (2016)
  15. Landelle, Franck; Peyrin, Thomas: Cryptanalysis of full RIPEMD-128 (2016)
  16. Picek, Stjepan; Yang, Bohan; Mentens, Nele: A search strategy to optimize the affine variant properties of S-boxes (2016)
  17. Yi, Xun; Yang, Xuechao; Feng, Yong; Han, Fengling; van Schyndel, Ron: CTM-sp: a family of cryptographic hash functions from chaotic tent maps (2016)
  18. Andreeva, Elena; Mennink, Bart; Preneel, Bart: Open problems in hash function security (2015)
  19. Bilgin, Begül; Nikova, Svetla; Nikov, Ventzislav; Rijmen, Vincent; Tokareva, Natalia; Vitkup, Valeriya: Threshold implementations of small S-boxes (2015)
  20. Blondeau, Céline; Nyberg, Kaisa: Perfect nonlinear functions and cryptography (2015)

1 2 3 next