Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices

DOI10.1515/jmc-2016-0066zbMath1468.94417OpenAlexW2963804406WikidataQ127492272 ScholiaQ127492272MaRDI QIDQ2009415

Arnaud Sipasseuth, Willy Susilo, Thomas Plantard

Publication date: 28 November 2019

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0066

zbMATH Keywords

lattice reductionGoldreich, Goldwasser and Halevi (GGH) schemelattice intersectionslattice-based cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (max. 100)

The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem

Uses Software

• BKZ
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of lengths of short vectors in a random lattice
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• On the Poisson distribution of lengths of lattice vectors in a random lattice
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Fast computation of Hermite normal forms of random integer matrices
• On Lovász' lattice reduction and the nearest lattice point problem
• Secure integration of asymmetric and symmetric encryption schemes
• On the complexity of the BKW algorithm on LWE
• On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
• Parallel Implementation of BDD Enumeration for LWE
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Pseudorandom Functions and Lattices
• Lattice Signatures without Trapdoors
• Lattice Cryptography for the Internet
• Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
• A linear space algorithm for computing the hermite normal form
• Computing the invariant structure of integer matrices
• Improving BDD Cryptosystems in General Lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
• An Efficient and Parallel Gaussian Sampler for Lattices
• Recursive Lattice Reduction
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Minkowski's Convex Body Theorem and Integer Programming
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Lattice Based Public Key Cryptosystem Using Polynomial Representations
• Attacks on the Search RLWE Problem with Small Errors
• On the equidistribution of Hecke points
• Solving BDD by Enumeration: An Update
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
• Secure integration of asymmetric and symmetric encryption schemes
• Lattice Decoding Attacks on Binary LWE
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• On Ideal Lattices and Learning with Errors over Rings
• Advances in Cryptology - CRYPTO 2003
• New lattice-based cryptographic constructions
• Predicting Lattice Reduction
• Topics in Cryptology – CT-RSA 2005
• Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
• Counting Co-Cyclic Lattices
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices