Skip to search formSkip to main contentSkip to account menu

Ideal lattice cryptography

Known as: Ideal Lattices and Cryptography 
Ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
Circulant matrixCollision (computer science)Collision resistanceCryptographic hash function

Broader (2)

Lattice-based cryptographyPost-quantum cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Post-Quantum Cryptocash ?
In this paper, we extend our work in FC 2018 to construct an anonymous and decentralized cryptocash system which is potentially… 
2017
2017
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing properties of… 
2016
2016
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems
We present an additively homomorphic commitment scheme with hardness based on the Ring-SIS problem. Our construction is… 
2014
2014
Generalized Hash Functions based on Multivariate Ideal Lattices
Lyubashevsky & Micciancio (2006) built collision resistant hash functions based on ideal lattices (in the univariate case) that… 
2014
2014
Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices
2013
2013
Parallel Gauss Sieve Algorithm: Solving the SVP in the Ideal Lattice of 128 dimensions
In this paper, we report that we have solved the shortest vector problem (SVP) over a 128-dimensional lattice, which is currently… 
2013
2013
Efficient Linear Homomorphic Encryption from LWE Over Rings
As the basis for secure public-key encryption under various cases, the learning with errors (LWE) problem has proved to be… 
2009
2009
Secure Parameters for SWIFFT
The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized… 
2007
2007
THE IDEAL LATTICES OF BALANCED PSEUDOCOMPLEMENTED OCKHAM ALGEBRAS
A balanced pseudocomplemented Ockham algebra is an algebra(L;∧,∨,f,*,0,1),in which(L;∧,∨,f,0,1) is an Ockham algebra,(L;∧,∨,*,0,1… 
1989
1989
P-Lattices as Ideal Lattices and Submodule Lattices
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)