The following pages link to (Q4526993):
Displaying 50 items.
- On random nonsingular Hermite normal form (Q266588) (← links)
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials (Q887439) (← links)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions (Q1021236) (← links)
- Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Security considerations for Galois non-dual RLWE families (Q1698662) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice (Q2218485) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Improved analysis of the reduction from BDD to uSVP (Q2419802) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Gauss Sieve Algorithm on GPUs (Q2975795) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← links)
