Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
From MaRDI portal
Publication:2938857
DOI10.1007/978-3-662-45611-8_22zbMath1306.94053OpenAlexW2208284559MaRDI QIDQ2938857
Antoine Joux, Pierre-Alain Fouque, Chrysanthi Mavromati
Publication date: 16 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45611-8_22
Related Items (12)
PRINCEv2. More security for (almost) no overhead ⋮ Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Public key encryption with filtered equality test revisited ⋮ Reflection ciphers ⋮ Key-Recovery Attacks Against the MAC Algorithm Chaskey ⋮ Everybody's a target: scalability in public-key encryption ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
Uses Software
This page was built for publication: Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
