Pages that link to "Item:Q5502803"
From MaRDI portal
The following pages link to The Complexity of Distinguishing Distributions (Invited Talk) (Q5502803):
Displaying 9 items.
- Rigorous upper bounds on data complexities of block cipher cryptanalysis (Q1676236) (← links)
- Multidimensional linear cryptanalysis (Q1715851) (← links)
- Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers (Q1934241) (← links)
- Accurate estimates of the data complexity and success probability for various cryptanalyses (Q2430686) (← links)
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 (Q2946869) (← links)
- Multiple Differential Cryptanalysis: Theory and Practice (Q3013076) (← links)
- Capacity and Data Complexity in Multidimensional Linear Attack (Q3457108) (← links)
- Asymptotic information leakage under one-try attacks (Q5740624) (← links)
- k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits (Q6166539) (← links)