XLS is not a strong pseudorandom permutation

DOI10.1007/978-3-662-45611-8_25MaRDI QIDQ2938860zbMATH OpenOpenAlexWikidataFDO

Authors Mridul Nandi

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_25

zbMATH Keywords

blockcipherdistinguishing advantagelength-preserving encryptionSPRPXLS

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• On the XOR of multiple random permutations
• Generic attacks for the Xor of k random permutations
• On the optimality of non-linear computations of length-preserving encryption schemes
• The indistinguishability of the XOR of k permutations

Cited in

(2)

• Quantum algorithms for the \(k\)-XOR problem
• Characterization of EME with linear mixing

This page was built for publication: XLS is not a strong pseudorandom permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938860)