SoK: on the security of cryptographic problems from linear algebra
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- scientific article; zbMATH DE number 3908520 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A framework for cryptographic problems from linear algebra
- A new public-key cryptosystem via Mersenne numbers
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Attacks on the AJPS Mersenne based cryptosystem
- Better algorithms for LWE and LWR
- Better key sizes (and attacks) for LWE-based encryption
- Coded-BKW: solving LWE using lattice codes
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Improved Generic Algorithms for Hard Knapsacks
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- Improved cryptanalysis of the AJPS Mersenne based cryptosystem
- Integer version of ring-LWE and its applications
- Lattice decoding attacks on binary LWE
- Lattice-based Cryptography
- Lazy modulus switching for the BKW algorithm on LWE
- Minkowski's Convex Body Theorem and Integer Programming
- NTRU prime: reducing attack surface at low cost
- New Algorithms for Learning in Presence of Errors
- New generic algorithms for hard knapsacks
- Noise-tolerant learning, the parity problem, and the statistical query model
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On Lovász' lattice reduction and the nearest lattice point problem
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the asymptotic complexity of solving LWE
- On the complexity of the BKW algorithm on LWE
- On the concrete hardness of learning with errors
- On the efficacy of solving LWE by reduction to unique-SVP
- On the hardness of the Mersenne Low Hamming Ratio assumption
- Predicting Lattice Reduction
- Provably weak instances of Ring-LWE
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Solving BDD by enumeration: an update
- The Knapsack Hash Function proposed at Crypto’89 can be broken
- The extended \(k\)-tree algorithm
- Weak instances of PLWE
- Worst-case to average-case reductions for module lattices
This page was built for publication: SoK: on the security of cryptographic problems from linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231700)
