CryptAttackTester: high-assurance attack analysis
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6488034 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 467153 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 3793915 (Why is no real title available?)
- scientific article; zbMATH DE number 3801619 (Why is no real title available?)
- scientific article; zbMATH DE number 3420627 (Why is no real title available?)
- A Monte Carlo Factoring Algorithm With Linear Storage
- A Rigorous Time Bound for Factoring Integers
- A cryptanalytic time-memory trade-off
- A method for obtaining digital signatures and public-key cryptosystems
- A monte carlo method for factorization
- 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
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A three-level sieve algorithm for the shortest vector problem
- Advances in Cryptology - CRYPTO 2003
- Algorithms in Algebraic Number Theory
- An Algorithmic Reduction Theory for Binary Codes: LLL and More
- An FPGA-Based Reconfigurable Mesh Many-Core
- An efficient key recovery attack on SIDH
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Analysis of information set decoding for a sub-linear error weight
- Approx-SVP in ideal lattices with pre-processing
- Approximate formulas for some functions of prime numbers
- Asymptotically Fast Factorization of Integers
- Attacking and Defending the McEliece Cryptosystem
- Biclique Cryptanalysis of the Full AES
- Bicliques with minimal data and time complexity for AES
- Computational Complexity
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Does the dual-sieve attack on learning with errors even work?
- Estimating quantum speedups for lattice sieves
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Gaussian elimination is not optimal
- Improved Generic Algorithms for Hard Knapsacks
- Improved classical and quantum algorithms for subset-sum
- Improving the biclique cryptanalysis of AES
- Integer multiplication in time \(O(n\log n)\)
- LWE with side information: attacks and concrete security estimation
- Logic minimization techniques with applications to cryptology
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Monte Carlo Methods for Index Computation (mod p)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- New directions in nearest neighbor searching with applications to lattice sieving
- New generic algorithms for hard knapsacks
- New representations of the AES key schedule
- Non-uniform cracks in the concrete: the power of free precomputation
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the concrete hardness of learning with errors
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Periods of rational maps modulo primes
- Post-quantum RSA
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Rigorous analysis of a randomised number field sieve
- Rigorous foundations for dual attacks in coding theory
- Sieve algorithms for the shortest vector problem are practical
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Smaller decoding exponents: ball-collision decoding
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Sorting on a mesh-connected parallel computer
- Statistical decoding 2.0: reducing decoding to LPN
- Syndrome Decoding Estimator
- The Area-Time Complexity of Binary Multiplication
- The security of the cipher block chaining message authentication code
- Toward a theory of Pollard's rho method
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- TweetNaCl: A Crypto Library in 100 Tweets
- Two decoding algorithms for linear codes
- Variation of periods modulo p in arithmetic dynamics
This page was built for publication: CryptAttackTester: high-assurance attack analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652984)
