15
votes
Uniform vs discrete Gaussian sampling in Ring learning with errors
The TL;DR:
From a theoretic point of view, Gaussians are the better choice, both for the easiness of the security proof and its optimality in terms of tightness;
In practice, most of the time you can ...
- 1,080
11
votes
NewHope and NIST's Post-quantum standardization
From Status Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process
3.12 NewHope
NewHope is a KEM based on the presumed hardness of the RLWE problem. At its core is ...
- 49.3k
11
votes
Accepted
Is Ring-LWE now (2021) broken?
Update: 20210403
TL;DR
If correct, the paper would affect the security of a wide range of RLWE systems, including all of the most commonly used variants.
However, the paper violates a "no go&...
- 25.3k
8
votes
Accepted
LWE and pseudorandom functions
You can. There is a certain caveat that should be mentioned here --- the LWE problems hardness is controlled (in part) by the size of the modulus $q$.
Two important parameter regimes are $q$ being ...
- 13.8k
8
votes
Accepted
RLWE Explanation
The cyclotomic polynomials are used in the proofs that worst-case lattice problems reduce to the RLWE. If you try to instantiate RLWE with other polynomials, then you don't have such formal guarantees ...
7
votes
Ring-LWE in other fields
We don’t always use power-of-two cyclotomics for RLWE. Many cryptosystems use other cyclotomics, or subfields thereof, or even other fields altogether. For example, many FHE schemes use non-two-power ...
- 5,863
7
votes
Accepted
MLWE (and RLWE) to LWE reductions proof
There is no known reduction from LWE to MLWE (or to RLWE). That is, it could be that both MLWE and RLWE are broken, yet LWE is secure.
However, this seems highly unlikely. To support the security of ...
- 20.8k
7
votes
How is R-LWE related to lattice cryptography and homomorphic encryption?
While I still think it would be good for you to ask more specific questions, the following might be useful in clearing up your understanding of the underlying hard problems on lattices. I do not see a ...
- 13.8k
7
votes
Ring Learning With Errors : why is it called ring and referred it as Ring LWE
So $R = \mathbb{Z}[x]/(x^n+1)$, where $x^n+1$ is an irreducible polynomial and n is a power of 2. So, this structure would not be a ring anymore, it would be a field. So, why is it called ring and ...
- 13.8k
6
votes
Accepted
Difference between FFT and NTT
TL;DR You need NTTs for exact arithmetic in crypto applications.
FFT is just an algorithm for evaluating the traditional DFT, for complex valued (note reals and integers are subsets of the complex ...
- 23.1k
5
votes
Accepted
Minimum distance between polynomials in ring-LWE
I'm assuming $n$ is a power of $2$ and that $q$ is an odd prime larger than $n$. I'm discarding the trivial case $s_1 = s_2$.
If you consider everything $\mod q$, then it is most likely over the ...
- 1,356
5
votes
Accepted
Why is low-degree polynomial preferred on Ring-LWE based somewhat homomorphic encryption?
The ciphertexts contains a certain amount of noise for security reasons. The downside is that if this noise is too big, the decryption will fail. When using homomorphic operations, the noise contained ...
- 996
5
votes
Famous ideal lattices
Yes, there are. The following table is taken from this paper of Ducas and van Woerden, although the results are not derived there (in the below, $p$ is an odd prime, and $n, m$ are coprime).
\begin{...
- 13.8k
5
votes
What is the difference between Poly-LWE and Ring-LWE?
One main difference is that in Ring-LWE, the ring $R$ is the full ring of integers $\mathcal{O}_K$ of a number field $K$, whereas in Poly-LWE it is of the form $R=\mathbb{Z}[x]/f(x)$ for some ...
- 5,863
5
votes
Is it secure to compute the exponentiation and the LWE operation?
For the second question, it depends on whether we can trust Bob to generate $a$ uniformly at random and without any “hidden structure.” If we can trust him, then this is secure assuming RLWE is hard; ...
- 5,863
5
votes
Accepted
Is FFT for power-of-two cyclotomic rings possible if q is not 1 modulo 2n?
Yes, in a way. When $q \neq 1 \mod 2n$ the ring $R_q$ is not fullt splitting (into polynomials of degree one). However, it might be splitting into several smaller polynomials of degree larger than one....
- 186
5
votes
Accepted
Choice of Polynomial Quotient Ring
common choice because we can efficiently compute products in this ring using the Number Theoretic Transform (NTT)
note that this is only true for special moduli $q\equiv 1\bmod 2n$. Lattice crypto is ...
- 13.8k
5
votes
Accepted
Questions about LWE in NIST standards
If you are referring to the recent published FIPS 203 and FIPS 204 standards which specify ML-KEM and ML-DSA respectively (both are Module Learning with Error primitives, which are a particular ...
- 25.3k
4
votes
Accepted
Why don't we use an Extendable Output Function to efficiently store the public key of Regev's LWE-based encryption scheme over standard lattices?
I believe it is also used in other lattice based schemes that use standard LWE. For example, the Frodo paper. They used a $seed_A$ and a Gen($\cdot$) function to compute $A$. Then Alice sends $seed_A$ ...
- 691
4
votes
$\ell_2$-norm vs canonical embedding norm on ring-lwe
I think you are mixing up some concepts... There are two things here: the embedding and the norm.
Those schemes are defined over polynomial rings, but for several reasons (e.g. to relate them with ...
4
votes
what does output parameters of lwe estimator stands for?
δ_0: the root Hermite factor required
β: the BKZ block size
d: the dimension of the lattice being reduced
m: the number of LWE samples used
4
votes
Replay attacks and LWE
By looking the encryption procedure, you will see that we use a different sum of the vectors $\vec a_i$'s at each encryption. Thus, every ciphertext has the form
$$(\vec a, ~\vec a\cdot \vec s + e + \...
4
votes
Is it secure to compute the exponentiation and the LWE operation?
Whether the interaction will reveal Alice's secret key?
I'm reading this like, Bob chose the base point $G$ and sends it to Alice then Alice sends back to Bob $[s]G$. The reason is simple, the ...
- 49.3k
4
votes
Accepted
Why does bootstrapping (R)LWE homomorphic encryption produce small noise?
The output of bootstrapping has relatively small noise because it starts from an encryption (of the secret key) that has very small noise, and performs some homomorphic operations on it. These ...
- 5,863
4
votes
Is FFT for power-of-two cyclotomic rings possible if q is not 1 modulo 2n?
Another alternative that can be viable in some scenarios
is to use the usual FFT over $\mathbb{C}$ instead of the Number Theoretic Transform (NTT) over $\mathbb{Z}_q$.
This is what FHEW does, for ...
4
votes
Functional and security model for SEAL
decryptions of Microsoft SEAL ciphertexts should be treated as private information only available to the secret key owner, as sharing decryptions of ciphertexts may in some cases lead to leaking the ...
- 13.8k
4
votes
Why RLWE is hard or even has a solution?
There are two key points that you are mentioning (one mentioned by Poncho in the comments --- I repeat here for exposition purposes).
The RLWE errors $e_i(x)$ are small, and
the secret $s(x)$ is ...
- 13.8k
4
votes
LWE and pseudorandom functions
This is my understanding so far, please correct if applicable.
We can construct PRF from any one-way function. Inefficient and require deep circuits.
We can construct PRF from LWR assumption (...
- 83
4
votes
Difference between FFT and NTT
Disclaimer: Comp-Sci math ahead, proper mathematicians beware. ;)
Fast Fourier Transform (FFT) and Discrete Fourier Transform (DFT)
The FFT is an algorithm which allows to calculate the DFT, as well ...
- 1,157
4
votes
Accepted
Closest Vector Problem in RLWE
CVP is a problem over general lattices. RLWE is a specialization of LWE to ideal lattices, a subset of all (general) lattices. So one can already define a perfectly reasonable version of CVP in the ...
- 13.8k
Only top scored, non community-wiki answers of a minimum length are eligible