XLS is Not a Strong Pseudorandom Permutation
Author:
- 1 January 2014
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 478-490
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parallelizable and Authenticated Online Ciphers2013
- Computational aspects of the expected differential probability of 4-round AES and AES-like ciphersComputing, 2009
- Elastic block ciphers: method, security and instantiationsInternational Journal of Information Security, 2009
- How to Enrich the Message Space of a CipherLecture Notes in Computer Science, 2007
- HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach2006
- A Parallelizable Enciphering Mode2004
- EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data2004
- A Tweakable Enciphering Mode2003
- Tweakable Block Ciphers2002
- How to Construct Pseudo-random Permutations from Pseudo-random Functions2000