CONCRETE ANALYSIS OF APPROXIMATE IDEAL-SIVP TO DECISION RING-LWE REDUCTION

Article Type

Research Article

Publication Title

Advances in Mathematics of Communications

Abstract

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 (SIVP) to the Decision Learning With Errors (DLWE) problem in ideal lattices. We give a concrete analysis of this multi-step reduction. We find that the tightness gap in the reduction is so great as to vitiate any meaningful security guarantee, and we find reasons to doubt the feasibility in the foreseeable future of the quantum part of the reduction. In addition, when we make the reduction concrete it appears that the approxi-mation factor in the SIVP problem is far larger than expected, a circumstance that causes the corresponding approximate-SIVP problem most likely not to be hard for proposed cryptosystem parameters. We also discuss implications for systems such as Kyber and SABER that are based on module-DLWE.

First Page

1216

Last Page

1258

DOI

10.3934/amc.2022082

Publication Date

10-1-2024

Comments

Open Access; Gold Open Access

Link to Full Text

Share

COinS