Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Subhadip Singha"'
Autor:
Palash Sarkar, Subhadip Singha
Publikováno v:
Advances in Mathematics of Communications. 17:484-499
Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a classical reduction from the gap shortest vector problem to LWE was obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e166463a03c09d59da466c4c17ad7813
https://doi.org/10.3934/amc.2021004
https://doi.org/10.3934/amc.2021004
Autor:
Palash Sarkar, Subhadip Singha
Publikováno v:
Advances in Mathematics of Communications. 15:257-266
A key step in Regev's (2009) reduction of the Discrete Gaussian Sampling (DGS) problem to that of solving the Learning With Errors (LWE) problem is a statistical test required for verifying possible solutions to the LWE problem. We derive a lower bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6a93590d4c84839fb7b68639296a269
https://doi.org/10.3934/amc.2020057
https://doi.org/10.3934/amc.2020057
Publikováno v:
Advances in Mathematics of Communications.
A seminal 2013 paper by Lyubashevsky, Peikert, and Regev proposed basing post-quantum cryptography on ideal lattices and supported this proposal by giving a polynomial-time security reduction from the approximate Shortest Independent Vectors Problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e3d034655f236b37e4a5312050d23ea
https://doi.org/10.3934/amc.2022082
https://doi.org/10.3934/amc.2022082