In cryptography, a sponge function or sponge construction is a class of algorithms with finite internal state that take an input bit stream of anyâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Senyang Huang, Xiaoyun Wang, Guangwu Xu, Meiqin Wang, Jingyuan Zhao
- EUROCRYPT
- 2016

Since Keccak was selected as SHA-3 hash function by NIST, it has attracted considerable attention from cryptographic researchersâ€¦Â (More)

Is this relevant?

2016

2016

- Sergey Agievich, Vadim Marchuk, Alexander Maslau, Vlad Semenov
- IACR Cryptology ePrint Archive
- 2016

We present the Bash family of hashing algorithms based on the sponge paradigm. A core element of this family is the Bash-f spongeâ€¦Â (More)

Is this relevant?

2014

2014

- Itai Dinur, Pawel Morawiecki, Josef Pieprzyk, Marian Srebrny, Michal Straus
- EUROCRYPT
- 2014

In this paper, we comprehensively study the resistance of keyed variants of SHA-3 (Keccak) against algebraic attacks. Thisâ€¦Â (More)

Is this relevant?

2014

2014

- Itai Dinur, Pawel Morawiecki, Josef Pieprzyk, Marian Srebrny, Michal Straus
- IACR Cryptology ePrint Archive
- 2014

In this paper we mount the cube attack on the Keccak sponge function. The cube attack, formally introduced in 2008, is anâ€¦Â (More)

Is this relevant?

2014

2014

- Philipp Jovanovic, Atul Luykx, Bart Mennink
- ASIACRYPT
- 2014

The Sponge function is known to achieve 2 security, where c is its capacity. This bound was carried over to keyed variants of theâ€¦Â (More)

Is this relevant?

2011

2011

- Elena Andreeva, Bart Mennink, Bart Preneel
- International Journal of Information Security
- 2011

Sponge functions were introduced by Bertoni etÂ al. as an alternative to the classical Merkle-DamgÃ¥rd design. Many hash functionâ€¦Â (More)

Is this relevant?

2011

2011

The advantage in differentiating the sponge construction from a random oracle is upper bounded by N22âˆ’(c+1), with N the number ofâ€¦Â (More)

Is this relevant?

2010

2010

This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functionsâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Guido Bertoni, Joan Daemen, MichaÃ«l Peeters, Gilles Van Assche
- EUROCRYPT
- 2008

In this paper we prove that the sponge construction introduced in [4] is indifferentiable from a random oracle when being usedâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Â

Is this relevant?