Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428139
DOI10.1007/b11817zbMath1122.94395OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428139
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Format-preserving encryption: a survey ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations ⋮ Format-Preserving Encryption Algorithms Using Families of Tweakable Blockciphers ⋮ Partition and mix: generalizing the swap-or-not shuffle ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ A Proof of Security in O(2 n ) for the Benes Scheme ⋮ On Lai-Massey and quasi-Feistel ciphers ⋮ Deterministic encryption with the Thorp shuffle ⋮ Generic attacks on the Lai-Massey scheme ⋮ Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme ⋮ The “Coefficients H” Technique ⋮ A Proof of Security in O(2 n ) for the Xor of Two Random Permutations ⋮ Private Information Retrieval Using Trusted Hardware
