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

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

1 2 3 4 next

  1. Dobraunig, Christoph; Eichlseder, Maria; Mendel, Florian; Schläffer, Martin: \textscAsconv1.2: lightweight authenticated encryption and hashing (2021)
  2. Mennink, Bart; Neves, Samuel: On the resilience of Even-Mansour to invariant permutations (2021)
  3. Shi, Tairong; Wu, Wenling; Hu, Bin; Guan, Jie; Wang, Sengpeng: Breaking LWC candidates: sESTATE and Elephant in quantum setting (2021)
  4. Zhao, Zishen; Chen, Shiyao; Wang, Meiqin; Wang, Wei: Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC (2021)
  5. Dobraunig, Christoph; Mendel, Florian; Mennink, Bart: Practical forgeries for ORANGE (2020)
  6. Grassi, Lorenzo; Rechberger, Christian: Revisiting Gilbert’s known-key distinguisher (2020)
  7. Guo, Jian; Liao, Guohong; Liu, Guozhen; Liu, Meicheng; Qiao, Kexin; Song, Ling: Practical collision attacks against round-reduced SHA-3 (2020)
  8. Kölbl, Stefan; Tischhauser, Elmar; Derbez, Patrick; Bogdanov, Andrey: Troika: a ternary cryptographic hash function (2020)
  9. Liu, Hongjun; Kadir, Abdurahman; Ma, Chao; Xu, Chengbo: Constructing keyed hash algorithm using enhanced chaotic map with varying parameter (2020)
  10. Bansal, Tarun Kumar; Boyen, Xavier; Pieprzyk, Josef: Signcryption schemes with insider security in an ideal permutation model (2019)
  11. Dobraunig, Christoph; Mangard, Stefan; Mendel, Florian; Primas, Robert: Fault attacks on nonce-based authenticated encryption: application to Keyak and Ketje (2019)
  12. Gao, Guangpu; Lin, Dongdai; Liu, Wenfen: A note on rotation symmetric S-boxes (2019)
  13. Mariot, Luca; Picek, Stjepan; Leporati, Alberto; Jakobovic, Domagoj: Cellular automata based S-boxes (2019)
  14. Neves, Samuel; Araujo, Filipe: An observation on NORX, BLAKE2, and ChaCha (2019)
  15. Stoffelen, Ko: Efficient cryptography on the RISC-V architecture (2019)
  16. Bertoni, Guido; Daemen, Joan; Peeters, Michaël; Van Assche, Gilles; Van Keer, Ronny; Viguier, Benoît: \textscKangarooTwelve: fast hashing based on (\mathrmKECCAK\mathrm-p) (2018)
  17. Bi, Wenquan; Li, Zheng; Dong, Xiaoyang; Li, Lu; Wang, Xiaoyun: Conditional cube attack on round-reduced River Keyak (2018)
  18. Hong, Deukjo; Koo, Bonwook; Seo, Changho: Differential property of \textscPresent-like structure (2018)
  19. Liu, Yunwen; Rijmen, Vincent; Leander, Gregor: Nonlinear diffusion layers (2018)
  20. Sasdrich, Pascal; Hutter, Michael: Protecting triple-DES against DPA. A practical application of domain-oriented masking (2018)

1 2 3 4 next