Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
From MaRDI portal
Publication:5447511
DOI10.1007/978-3-540-77272-9_7zbMath1154.94434OpenAlexW2132338599MaRDI QIDQ5447511
Juan M. E. Tapiador, John A. Clark, Julio Cesar Hernandez Castro
Publication date: 7 March 2008
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77272-9_7
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Authentication, digital signatures and secret sharing (94A62)
Related Items
Cites Work
- Optimization by Simulated Annealing
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Non-Linear Approximations in Linear Cryptanalysis
- Des has no Per Round Linear Factors
- Fast Software Encryption
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item