Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lattice-crypto
Search options not deleted
user 109673
Lattice-cryptography is the study and use of lattice problems applied to cryptography.
1
vote
About learning with error rings with only constant coefficient
Yes, you could encrypt the message $5$ as a polynomial $f = 5$ in the polynomial ring, which is usually something like $R := \mathbb Z [X] / \langle x^N + 1 \rangle$ with $N$ being quite large $>2^{10 …
- 66
3
votes
Two problem about noise management of BFV
Problem 2 first. If you use $E=2*\delta_R*B$ as an initial noise and you perform $L$ multiplications (using the same ciphertext), then you multiply (see Lemma 2) the noise $E$ each time by $t\cdot \de …
- 66