spongent: A Lightweight Hash Function. This paper proposes spongent – a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Its smallest implementations in ASIC require 738, 1060, 1329, 1728, and 1950 GE, respectively. To our best knowledge, at all security levels attained, it is the hash function with the smallest footprint in hardware published so far, the parameter being highly technology dependent. spongent offers a lot of flexibility in terms of serialization degree and speed. We explore some of its numerous implementation trade-offs. We furthermore present a security analysis of spongent. Basing the design on a present-type primitive provides confidence in its security with respect to the most important attacks. Several dedicated attack approaches are also investigated.

References in zbMATH (referenced in 21 articles )

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

1 2 next

  1. Bordes, Nicolas; Daemen, Joan; Kuijsters, Daniël; Van Assche, Gilles: Thinking outside the superbox (2021)
  2. Shi, Tairong; Wu, Wenling; Hu, Bin; Guan, Jie; Wang, Sengpeng: Breaking LWC candidates: sESTATE and Elephant in quantum setting (2021)
  3. Belaïd, Sonia; Dagand, Pierre-Évariste; Mercadier, Darius; Rivain, Matthieu; Wintersdorff, Raphaël: Tornado: automatic generation of probing-secure masked bitsliced implementations (2020)
  4. Jovanovic, Philipp; Luykx, Atul; Mennink, Bart; Sasaki, Yu; Yasuda, Kan: Beyond conventional security in sponge-based authenticated encryption modes (2019)
  5. Czajkowski, Jan; Groot Bruinderink, Leon; Hülsing, Andreas; Schaffner, Christian; Unruh, Dominique: Post-quantum security of the sponge construction (2018)
  6. Hong, Deukjo; Koo, Bonwook; Seo, Changho: Differential property of \textscPresent-like structure (2018)
  7. Banik, Subhadeep; Pandey, Sumit Kumar; Peyrin, Thomas; Sasaki, Yu; Sim, Siang Meng; Todo, Yosuke: GIFT: a small present. Towards reaching the limit of lightweight encryption (2017)
  8. de Groot, Wouter; Papagiannopoulos, Kostas; de La Piedra, Antonio; Schneider, Erik; Batina, Lejla: Bitsliced masking and ARM: friends or foes? (2017)
  9. Gueron, Shay; Mouha, Nicky: Simpira v2: a family of efficient permutations using the AES round function (2016)
  10. Picek, Stjepan; Yang, Bohan; Mentens, Nele: A search strategy to optimize the affine variant properties of S-boxes (2016)
  11. Lallemand, Virginie; Naya-Plasencia, María: Cryptanalysis of KLEIN (2015)
  12. Benadjila, Ryad; Guo, Jian; Lomné, Victor; Peyrin, Thomas: Implementing lightweight block ciphers on \textttx86 architectures (2014)
  13. Bulygin, Stanislav; Walter, Michael; Buchmann, Johannes: Full analysis of \textscPRINTcipherwith respect to invariant subspace attack: efficient key recovery and countermeasures (2014)
  14. Gong, Zheng; Hartel, Pieter; Nikova, Svetla; Tang, Shao-Hua; Zhu, Bo: TuLP: a family of lightweight message authentication codes for body sensor networks (2014) ioport
  15. Aumasson, Jean-Philippe; Henzen, Luca; Meier, Willi; Naya-Plasencia, María: Quark: a lightweight hash (2013)
  16. Bogdanov, Andrey; Knežević, Miroslav; Leander, Gregor; Toz, Deniz; Varıcı, Kerem; Verbauwhede, Ingrid: SPONGENT: the design space of lightweight cryptographic hashing (2013)
  17. Walter, Michael; Bulygin, Stanislav; Buchmann, Johannes: Optimizing guessing strategies for algebraic cryptanalysis with applications to EPCBC (2013)
  18. Bertoni, Guido; Daemen, Joan; Peeters, Michaël; Van Assche, Gilles: Duplexing the sponge: Single-pass authenticated encryption and other applications (2012)
  19. Chang, Donghoon: Sufficient conditions on padding schemes of sponge construction and sponge-based authenticated-encryption scheme (2012)
  20. Aumasson, Jean-Philippe; Naya-Plasencia, María; Saarinen, Markku-Juhani O.: Practical attack on 8 rounds of the lightweight block cipher KLEIN (2011)

1 2 next