Information Security and Cryptology - ICISC 2005

DOI10.1007/11734727zbMath1141.94368OpenAlexW2493058093MaRDI QIDQ5899284

Jacques Patarin, Audrey Montreuil

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11734727

zbMATH Keywords

unconditional securitypseudo-random functionsdesign of keyed hash functionsinformation-theoretic primitive

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Quantum cryptanalysis of 5 rounds Feistel schemes and Benes schemes ⋮ Tight security of cascaded LRW2 ⋮ A Proof of Security in O(2 n ) for the Benes Scheme ⋮ How to build optimally secure PRFs using block ciphers ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model

This page was built for publication: Information Security and Cryptology - ICISC 2005