CryptAttackTester: high-assurance attack analysis
From MaRDI portal
Publication:6652984
DOI10.1007/978-3-031-68391-6_5MaRDI QIDQ6652984
Tung Chou, Daniel J. Bernstein
Publication date: 13 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Toward a theory of Pollard's rho method
- Two decoding algorithms for linear codes
- Variation of periods modulo \(p\) in arithmetic dynamics
- Post-quantum RSA
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Rigorous analysis of a randomised number field sieve
- Periods of rational maps modulo primes
- New representations of the AES key schedule
- LWE with side information: attacks and concrete security estimation
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Approx-SVP in ideal lattices with pre-processing
- Logic minimization techniques with applications to cryptology
- Gaussian elimination is not optimal
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Approximate formulas for some functions of prime numbers
- Integer multiplication in time \(O(n\log n)\)
- Estimating quantum speedups for lattice sieves
- Improved classical and quantum algorithms for subset-sum
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Bicliques with Minimal Data and Time Complexity for AES
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
- TweetNaCl: A Crypto Library in 100 Tweets
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- A Three-Level Sieve Algorithm for the Shortest Vector Problem
- Improved Generic Algorithms for Hard Knapsacks
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Biclique Cryptanalysis of the Full AES
- Improving the Biclique Cryptanalysis of AES
- A Monte Carlo Factoring Algorithm With Linear Storage
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Attacking and Defending the McEliece Cryptosystem
- Sieve algorithms for the shortest vector problem are practical
- New Generic Algorithms for Hard Knapsacks
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A cryptanalytic time-memory trade-off
- Asymptotically Fast Factorization of Integers
- The Area-Time Complexity of Binary Multiplication
- Algorithms in Algebraic Number Theory
- A Rigorous Time Bound for Factoring Integers
- A monte carlo method for factorization
- Sorting on a mesh-connected parallel computer
- A method for obtaining digital signatures and public-key cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- New directions in nearest neighbor searching with applications to lattice sieving
- Syndrome Decoding Estimator
- An Algorithmic Reduction Theory for Binary Codes: LLL and More
- Smaller Decoding Exponents: Ball-Collision Decoding
- An FPGA-Based Reconfigurable Mesh Many-Core
- Advances in Cryptology - CRYPTO 2003
- Computational Complexity
- The security of the cipher block chaining message authentication code
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- An efficient key recovery attack on SIDH
- Does the dual-sieve attack on learning with errors even work?
- Statistical decoding 2.0: reducing decoding to LPN
- Rigorous foundations for dual attacks in coding theory
This page was built for publication: CryptAttackTester: high-assurance attack analysis
