The following pages link to Predicting Lattice Reduction (Q5458584):
Displaying 36 items.
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
- Choosing Parameters for NTRUEncrypt (Q2975792) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Application of mixed integer quadratic program to shortest vector problems (Q3121492) (← links)
- On the Efficacy of Solving LWE by Reduction to Unique-SVP (Q3193270) (← links)
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem (Q3297646) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Interpreting Hash Function Security Proofs (Q4933215) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients (Q5034517) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem (Q6123830) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- An identity-based blind signature scheme using lattice with provable security (Q6534733) (← links)
- Identity-based encryption from lattices using approximate trapdoors (Q6535489) (← links)
- On the concrete security of LWE with small secret (Q6611798) (← links)
- Key recovery attack on the partial Vandermonde knapsack problem (Q6637720) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
