Abstract
We show how to produce a forged (ciphertext, tag) pair for the scheme ALE with data and time complexity of 2102 ALE encryptions of short messages and the same number of authentication attempts. We use a differential attack based on a local collision, which exploits the availability of extracted state bytes to the adversary. Our approach allows for a time-data complexity tradeoff, with an extreme case of a forgery produced after 2119 attempts and based on a single authenticated message. Our attack is further turned into a state recovery and a universal forgery attack with a time complexity of 2120 verification attempts using only a single authenticated 48-byte message.
Original language | English |
---|---|
Title of host publication | Selected Areas in Cryptography - SAC 2013. Revised Selected Papers |
Publisher | Springer |
Publication date | 2014 |
Pages | 174-184 |
ISBN (Print) | 978-3-662-43413-0 |
ISBN (Electronic) | 978-3-662-43414-7 |
DOIs | |
Publication status | Published - 2014 |
Event | 20th International Workshop on Selected Areas of Cryptography - Burnaby, Canada Duration: 14 Aug 2013 → 16 Aug 2013 Conference number: 20 |
Conference
Conference | 20th International Workshop on Selected Areas of Cryptography |
---|---|
Number | 20 |
Country/Territory | Canada |
City | Burnaby |
Period | 14/08/2013 → 16/08/2013 |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 8282 |
ISSN | 0302-9743 |
Keywords
- Data Encryption
- Systems and Data Security
- Algorithm Analysis and Problem Complexity
- Coding and Information Theory