SPONGENT: The Design Space of Lightweight Cryptographic Hashing
From MaRDI portal
Publication:5274529
Cited in
(20)- Breaking LWC candidates: sESTATE and Elephant in quantum setting
- Multi-user BBB security of public permutations based MAC
- Thinking outside the superbox
- Differential property of \textsc{Present}-like structure
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- SPN-Hash: Improving the Provable Resistance against Differential Collision Attacks
- The multiplicative complexity of Boolean functions on four and five variables
- Simpira v2: a family of efficient permutations using the AES round function
- Speeding up the search algorithm for the best differential and best linear trails
- Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
- New bounds for keyed sponges with extendable output: independence between capacity and message length
- Lightweight MDS generalized circulant matrices
- scientific article; zbMATH DE number 6999717 (Why is no real title available?)
- Improved integral attack on generalized Feistel cipher
- BBB secure nonce based MAC using public permutations
- BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
- Simplified MITM modeling for permutations: new (quantum) attacks
- Designing tweakable enciphering schemes using public permutations
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
This page was built for publication: SPONGENT: The Design Space of Lightweight Cryptographic Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274529)
