Memory-Efficient Attacks on Small LWE Keys

Combinatorial attacks on small max norm LWE keys suffer enormous memory requirements, which render them inefficient in realistic attack scenarios. Therefore, more memory-efficient substitutes for these algorithms are needed. In this work, we provide new combinatorial algorithms for recovering small...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of cryptology Vol. 37; no. 4; p. 36
Main Authors:	Esser, Andre, Mukherjee, Arindam, Sarkar, Santanu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2024 Springer Nature B.V
Subjects:	Algorithms Binomial distribution Coding and Information Theory Combinatorial analysis Combinatorics Communications Engineering Computational Mathematics and Numerical Analysis Computer Science Networks Polynomials Probability Theory and Stochastic Processes Research Article Nested collision search Time-memory trade-off Representation technique Polynomial memory Combinatorial attacks Learning with errors
ISSN:	0933-2790, 1432-1378
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!