Pages that link to "Item:Q2692355"
From MaRDI portal
The following pages link to Lower bounds on the degree of block ciphers (Q2692355):
Displaying 15 items.
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems (Q1745698) (← links)
- On the effective block size in Harper's theorem (Q1902351) (← links)
- Modeling for three-subset division property without unknown subset (Q2044753) (← links)
- Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128 (Q2152163) (← links)
- (Q4636658) (← links)
- Cryptanalysis of reduced round SPEEDY (Q6103079) (← links)
- On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC (Q6135435) (← links)
- Convexity of division property transitions: theory, algorithms and compact models (Q6157497) (← links)
- Massive superpoly recovery with nested monomial predictions (Q6157499) (← links)
- Mathematical aspects of division property (Q6165429) (← links)
- Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting (Q6169473) (← links)
- Finding three-subset division property for ciphers with complex linear layers (Q6169477) (← links)
- Stretching cube attacks: improved methods to recover massive superpolies (Q6175991) (← links)
- A simpler model for recovering superpoly on Trivium (Q6618593) (← links)
- More balanced polynomials: cube attacks on 810- and 825-round Trivium with practical complexities (Q6620028) (← links)
