The following pages link to Lattice-based Cryptography (Q3613268):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\) (Q1993548) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- A trace map attack against special ring-LWE samples (Q2128748) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- The polynomial learning with errors problem and the smearing condition (Q2168804) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\) (Q2402971) (← links)
- Cryptanalysis of the CLR-cryptosystem (Q2414934) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Sharper bounds on four lattice constants (Q2672303) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Post-Quantum Forward-Secure Onion Routing (Q2794504) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme (Q2953874) (← links)
- Tuple lattice sieving (Q2971007) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
