The cryptographic sponge is a construction scheme for hash functions (and other symmetric primitives) based on an unkeyed permutation. The most famous example is Keccak, which won the SHA-3 competition.
Questions tagged [sponge]
76 questions
5
votes
1 answer
Spritz cipher sponge function capacity
Rivest and Shuldt proposed a new sponge like cipher algorithm called Spritz:
http://people.csail.mit.edu/rivest/pubs/RS14.pdf
In this paper they say that the strength of the cipher is related to the bit-capacity of its sponge-like internal function.…
Simon G.
- 343
- 2
- 5
4
votes
1 answer
256-bit security with Sponges
Cryptographic sponge functions are a hot topic right now with LWC and all.
They solve the symmetric crypto problem with simplicity and efficiency. However,
none of them seem to achieve 256-bit security without relying on a gigantic state
(such as…
luiz
- 41
- 2
1
vote
1 answer
What is the rationale design of TinyJambu-LWC?
My understanding of duplex construction is usually initialized with the key at the beginning of the mode, but I have noticed that TinyJambu (in addition to key intilization) is using key in each processing call (keyed permutation) as shown in…
hardyrama
- 2,126
- 1
- 16
- 40