Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.94035WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311561

Jacques Patarin

Publication date: 23 August 2005

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

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

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Format-preserving encryption: a survey, Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions, Partition and mix: generalizing the swap-or-not shuffle, Proof of mirror theory for a wide range of \(\xi_{\max }\), BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers, \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH, Generic attacks on the Lai-Massey scheme, On Lai-Massey and quasi-Feistel ciphers, Related-key analysis of generalized Feistel networks with expanding round functions, The key-dependent message security of key-alternating Feistel ciphers, Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security, Mirror theory and cryptography, Deterministic encryption with the Thorp shuffle, Provable related-key security of contracting Feistel networks, Linear cryptanalysis of FF3-1 and FEA, Optimum attack on 3-round Feistel-2 structure, Building blockcipher from small-block tweakable blockcipher, Derandomized constructions of \(k\)-wise (almost) independent permutations, Beyond-birthday secure domain-preserving PRFs from a single permutation, Hardness-preserving reductions via cuckoo hashing, Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme, Beyond-birthday security for permutation-based Feistel networks, Format-Preserving Encryption Algorithms Using Families of Tweakable Blockciphers, Towards Understanding the Known-Key Security of Block Ciphers, Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal, A Proof of Security in O(2 n ) for the Benes Scheme, Luby-Rackoff Ciphers from Weak Round Functions?, A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier, Building Secure Block Ciphers on Generic Attacks Assumptions