SPONGENT: The Design Space of Lightweight Cryptographic Hashing

DOI10.1109/TC.2012.196zbMath1365.94406MaRDI QIDQ5274529

Andrey Bogdanov, Kerem Varici, Ingrid Verbauwhede, Deniz Toz, Miroslav Knežević, Gregor Leander

Publication date: 12 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (17)

Improved Integral Attack on Generalized Feistel Cipher ⋮ Thinking outside the superbox ⋮ BBB Secure Nonce Based MAC Using Public Permutations ⋮ Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails ⋮ Differential property of \textsc{Present}-like structure ⋮ The Multiplicative Complexity of Boolean Functions on Four and Five Variables ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ Designing tweakable enciphering schemes using public permutations ⋮ New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length ⋮ Lightweight MDS Generalized Circulant Matrices ⋮ Breaking LWC candidates: sESTATE and Elephant in quantum setting ⋮ Multi-user BBB security of public permutations based MAC

Uses Software

• spongent

This page was built for publication: SPONGENT: The Design Space of Lightweight Cryptographic Hashing