The following pages link to Making the impossible possible (Q1747659):
Displaying 10 items.
- Improving key-recovery in linear attacks: application to 28-round PRESENT (Q2055609) (← links)
- New representations of the AES key schedule (Q2056670) (← links)
- Quantum Demiric-Selcuk meet-in-the-middle attacks on reduced-round AES (Q2118720) (← links)
- Key guessing strategies for linear key-schedule algorithms in rectangle attacks (Q2170076) (← links)
- Bounding the length of impossible differentials for SPN block ciphers (Q2234462) (← links)
- More accurate results on the provable security of AES against impossible differential cryptanalysis (Q2334448) (← links)
- Improved key recovery attacks on reduced-round AES with practical data and memory complexities (Q5918865) (← links)
- On the primitivity of the AES-128 key-schedule (Q6090967) (← links)
- Quantum impossible differential attacks: applications to AES and SKINNY (Q6130615) (← links)
- Non-existence of one-byte active impossible differentials for 5-round AES in the master-key setting (Q6131038) (← links)
