Pages that link to "Item:Q2446068"
From MaRDI portal
The following pages link to On computational complexity of impossible differential cryptanalysis (Q2446068):
Displaying 8 items.
- A unified method for finding impossible differentials of block cipher structures (Q903652) (← links)
- Impossible differential cryptanalysis using matrix method (Q966035) (← links)
- Upper bound of the length of truncated impossible differentials for AES (Q1647567) (← links)
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (Q1667453) (← links)
- Making the impossible possible (Q1747659) (← links)
- (Q3046616) (← links)
- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix (Q5095923) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)