Lattice-based cryptography offers some of the most attractive primitives believed to be
resistant to quantum computers. Following increasing interest from both companies and …

Designing public key cryptosystems that resist attacks by quantum computers is an important
area of current cryptographic research and standardization. To retain confidentiality of …

Asymptotically, the best known algorithms for solving the Shortest Vector Problem (SVP) in a
lattice of dimension n are sieve algorithms, which have heuristic complexity estimates …

By replacing the brute-force list search in sieving algorithms with Charikar's angular locality-
sensitive hashing (LSH) method, we get both theoretical and practical speedups for solving …

Search problems in cryptography Page 1 Search problems in cryptography: from fingerprinting
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …

In view of the expected progress in cryptanalysis it is important to find alternatives for
currently used signature schemes such as RSA and ECDSA. The most promising lattice …

Most algorithms for hard lattice problems are based on the principle of rank reduction: to
solve a problem in ad-dimensional lattice, one first solves one or more problem instances in …

Fully homomorphic encryption (FHE) is a cryptographic technology with the potential to
revolutionize data privacy by enabling computation on encrypted data. Lately, the CKKS …

Lattice-based cryptography has gained credence recently as a replacement for current
public-key cryptosystems, due to its quantum-resilience, versatility, and relatively low key …

Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to
significantly speed up lattice sieving, leading to a heuristic time complexity for solving the …