The Delicate Issues of Addition with Respect to XOR Differences
From MaRDI portal
Publication:5452258
DOI10.1007/978-3-540-77360-3_14zbMath1154.94438OpenAlexW1801799740MaRDI QIDQ5452258
Nathan Keller, Orr Dunkelman, Gaoli Wang
Publication date: 25 March 2008
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77360-3_14
Related Items (8)
Counting active S-boxes is not enough ⋮ A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis ⋮ Revisiting related-key boomerang attacks on AES using computer-aided tool ⋮ The phantom of differential characteristics ⋮ MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck ⋮ Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK ⋮ The (related-key) impossible boomerang attack and its application to the AES block cipher ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Markov Ciphers and Differential Cryptanalysis
- Amplified Boomerang Attack against Reduced-Round SHACAL
- Information Security and Privacy
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- How to Break MD5 and Other Hash Functions
- Related-Key Boomerang and Rectangle Attacks
- A Simple Related-Key Attack on the Full SHACAL-1
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- Differential and Rectangle Attacks on Reduced-Round SHACAL-1
- New Cryptanalytic Results on IDEA
- Fast Software Encryption
- Fast Software Encryption
- Fast Software Encryption
This page was built for publication: The Delicate Issues of Addition with Respect to XOR Differences
