A Known-Plaintext Attack with Minimal Data Complexity on 25-Round CRAFT
Date:
Presentation of the paper A Known-Plaintext Attack with Minimal Data Complexity on 25-Round CRAFT at FSE 2026.
Patrick Neumann
Researcher in Symmetric Cryptography
- Inria
- 48 Rue Barrault, Paris, France
- Google Scholar
- ORCID
- DBLP
- GitHub