Mirror theory and cryptography

DOI10.1007/S00200-017-0326-YzbMath1375.94154OpenAlexW2615109279MaRDI QIDQ1675488

Jacques Patarin

Publication date: 27 October 2017

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-017-0326-y

zbMATH Keywords

generic cryptographic systemsnumber of solutions of linear systems of equalities and inequalitiessecurity proofs in cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Tight security of cascaded LRW2 ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Improved multi-user security using the squared-ratio method ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ Provably secure reflection ciphers ⋮ How to build optimally secure PRFs using block ciphers

Cites Work

• Unnamed Item
• The “Coefficients H” Technique
• Advances in Cryptology – CRYPTO 2004
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• A Combinatorial Problem on Abelian Groups
• Information Security and Cryptology - ICISC 2005

This page was built for publication: Mirror theory and cryptography