Lattice Attacks for Variants of LWE
1 900
30.2
Microsoft Research335 тыс
Следующее
19.06.19 – 2 9501:16:31Популярные
07.12.22 – 3263:22
03.11.22 – 7851:00:39Опубликовано 19 июня 2019, 16:58
The learning with errors (LWE) problem introduced by Regev (STOC'05) is one of the fundamental problems in lattice-based cryptography. It has been used extensively as a security foundation, for public-key encryption, signatures, fully homomorphic encryption (FHE), pseudo-random functions (PRF) and many others. One standard strategy to solve the LWE problem is to reduce it to a unique SVP (uSVP) problem via Kannan's embedding and then apply a lattice reduction to solve the uSVP problem. In this talk, we will discuss and compare various lattice algorithms for solving LWE, and then give some concrete estimates for breaking various variants of LWE (e.g. generic, small secrets, restricted samples). In the end, we will discuss some recent developments on algorithms for solving LWE.
See more at microsoft.com/en-us/research/v...
See more at microsoft.com/en-us/research/v...
Свежие видео
8 дней – 5 2090:31
12 дней – 342 7308:36
16 дней – 7040:04
16 дней – 27 89331:50Случайные видео
133 дня – 3 0840:23
190 дней – 66314:23
202 дня – 47 55318:59
268 дней – 115 9180:30
03.04.22 – 1 510 77613:43
03.03.14 – 3 5063:08
3 дня – 4250:09
6 дней – 489 8282:58:34
9 дней – 31322:30
12 дней – 128 30114:42
13 дней – 4434:01
15 дней – 1266:19
16 дней – 1172:50
4 часа – 212:58