Lattice Signatures Schemes
2 159
28.8
Microsoft Research332 тыс
Следующее
08.07.16 – 5141:04:11Популярные
22 дня – 1 1222:05
50 дней – 1 0566:36Опубликовано 8 июля 2016, 1:04
Recent work has solidly established lattice-based signatures as a viable replacement for number-theoretic schemes should quantum computing come into fruition. In fact, the current lattice-based schemes have key and signature sizes comparable to RSA while being an order of magnitude faster. The main focus of this talk will be presenting the main ideas behind the latest results in this area. In addition to the high level intuition, I will try to motivate the many employed optimizations, such as having an NTRU-like public key and sampling from a bimodal Gaussian distribution. Most of the talk will be based on the papers "Lattice Signatures without Trapdoors" and "Lattice Signatures and Bimodal Gaussians". The latter is joint work with Leo Ducas, Alain Durmus, and Tancrede Lepoint.
Свежие видео
6 дней – 4750:29
9 дней – 50 24143:04
12 дней – 98 09411:02
12 дней – 17 80625:10
13 дней – 3211:00Случайные видео
98 дней – 14 4320:14
176 дней – 1 5391:11
25.06.23 – 371 2670:24
30.01.23 – 177 3932:17
11.09.22 – 115 9400:37
1 день – 3082:41
1 день – 2 6770:51
3 дня – 1611:59
5 дней – 176 3015:39
9 дней – 2966:27
13 дней – 1 4570:55
5 дней – 2 1708:12