Pages that link to "Item:Q510448"
From MaRDI portal
The following pages link to Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448):
Displaying 6 items.
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (Q1667453) (← links)
- MRHS solver based on linear algebra and exhaustive search (Q1787192) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \) (Q2285775) (← links)
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC (Q4922044) (← links)
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields (Q6542664) (← links)
