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 83923
Lattice-cryptography is the study and use of lattice problems applied to cryptography.
3
votes
2
answers
141
views
A Smudging Lemma in Lattice
I saw a paper LLW21 in EUROCRYPT 2021 that used this lemma, but there was no proof or references.
How should this lemma be proved ？
- 311
0
votes
0
answers
55
views
Does randomization make a big difference in the output of the BKZ algorithm?
We all know that block Korkine-Zolotarev (BKZ) algorithm is essentially a deterministic lattice reduction algorithm. However, in the actual implementation, the BKZ algorithm contains some randomizati …
- 311
0
votes
Base of $(n+1)$ elements in a lattice
You just need to use LLL algorithm for $(b_1, \dots, b_{n+1})$. More specifically, In BGPS21,the Algorithm 1 and Theorem 3.6 gave a more efficient algorithm than LLL.
- 311
6
votes
Reducing exact SVP to exact SIVP
It is non-trivial, You need to see the Corollary 7 in Mic07, Micciancio proved that a series of problems (including CVP and SIVP) in the Euclidean norm are equivalent in their exact version under pol …
- 311