MiniSHAKE

Guido Bertoni; Joan Daemen; Seth Hoffert; Silvia Mella; Michaël Peeters; Gilles Van Assche; Ronny Van Keer

Paper 2026/2363

MiniSHAKE

Guido Bertoni

, Security Pattern

Joan Daemen

, Radboud University Nijmegen

Seth Hoffert

Silvia Mella

, Radboud University Nijmegen

Michaël Peeters, STMicroelectronics (Belgium)

Gilles Van Assche

, STMicroelectronics (Belgium)

Ronny Van Keer, STMicroelectronics (Belgium)

Abstract

The overwhelming majority of the Keccak instances standardized and used in practice today make use of the Keccak-$f$ [1600] permutation or reduced-round versions of it. There are a few use cases where using a smaller permutation width would be beneficial, notably when one has to hash many very short messages. To address this, the present note defines instances that use the Keccak-$p$[800, $n_r = 12$] permutation, collectively under the name MiniSHAKE.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
Keywords: symmetric cryptography hashing Keccak
Contact author(s): all @ keccak team
History: 2026-10-07: approved; 2026-10-05: received; See all versions
Short URL: https://ia.cr/2026/2363
License: CC BY

BibTeX

@misc{cryptoeprint:2026/2363,
      author = {Guido Bertoni and Joan Daemen and Seth Hoffert and Silvia Mella and Michaël Peeters and Gilles Van Assche and Ronny Van Keer},
      title = {{MiniSHAKE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2363},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2363}
}