DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Lattice problem
Lattice problem
Lectures on the NTRU Encryption Algorithm and Digital Signature Scheme: Grenoble, June 2002
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
On Ideal Lattices and Learning with Errors Over Rings∗
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
Making NTRU As Secure As Worst-Case Problems Over Ideal Lattices
Lower Bounds on Lattice Sieving and Information Set Decoding
Algorithms for the Densest Sub-Lattice Problem
Lattices in MIMO Spatial Multiplexing
Hardness of Bounded Distance Decoding on Lattices in Lp Norms
Limits on the Hardness of Lattice Problems in Lp Norms
A Decade of Lattice Cryptography
On the Concrete Hardness of Learning with Errors
New (And Old) Proof Systems for Lattice Problems
The Two Faces of Lattices in Cryptology
An Introduction to the Theory of Lattices and Applications to Cryptography Joseph H
Techniques for Solving Shortest Vector Problem
Lattice-Based Cryptography
Lattice Based Cryptography
Top View
Complexity of Lattice Problems
A Lightweight Implementation of Ntruencrypt for 8-Bit AVR Microcontrollers
Choosing Ntruencrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
Classical Hardness of Learning with Errors
NTRU and Lattice-Based Crypto: Past, Present, and Future Joseph H
Lattices and the NIST PQ-Crypto Standardization Process
Encryption from Learning with Errors
Learning with Errors (LWE) Problem, Discuss Its Properties, Its Hardness, and Its Cryptographic Applications
Algorithms for the Elliptic Curve Discrete Logarithm and the Approximate Common Divisor Problem
Quantum Algorithms for Computing General Discrete Logarithms and Orders with Tradeoffs
Revision 1 of Report No
Quantum Computation and Lattice Problems ∗ 1
A Local-Global Approach to Solving Ideal Lattice Problems
The Closest Vector Problem in Cyclotomic Lattices
Arxiv:2006.14057V7 [Quant-Ph] 4 Mar 2021 Tem Is Measured to Be in Some Eigenstate of a Divide N by That Factor to Ascertain the Other
Hardness of Lattice Problems for Use in Cryptography
Lattices, Learning with Errors and Post-Quantum Cryptography Lecture
Proof Systems for Lattice Problems
Rigorous and Efficient Short Lattice Vectors Enumeration
Cryptographic Functions from Worst-Case Complexity Assumptions
Lattices, Cryptography, and NTRU an Introduction to Lattice Theory and The
A Novel Lattice Reduction Algorithm
Lattices in Cryptography Andy Guo
[email protected]
A Report on Learning with Errors Over Rings
Lattices & Cryptology
Physical-Layer Cryptography Through Massive MIMO