Cryptology ePrint Archive: Report 2021/1491

The Hidden Lattice Problem

Luca Notarnicola and Gabor Wiese

Abstract: We consider the problem of revealing a small hidden lattice from the knowledge of a low-rank sublattice modulo a given sufficiently large integer – the Hidden Lattice Problem. A central motivation of study for this problem is the Hidden Subset Sum Problem, whose hardness is essentially determined by that of the hidden lattice problem. We describe and compare two algorithms for the hidden lattice problem: we first adapt the algorithm by Nguyen and Stern for the hidden subset sum problem, based on orthogonal lattices, and propose a new variant, which we explain to be related by duality in lattice theory. Following heuristic, rigorous and practical analyses, we find that our new algorithm brings some advantages as well as a competitive al- ternative for algorithms for problems with cryptographic interest, such as Approximate Common Divisor Problems, and the Hidden Subset Sum Problem. Finally, we study variations of the problem and highlight its relevance to cryptanalysis.

Category / Keywords: Euclidean Lattices, Lattice Reduction, Cryptanalysis, Approximate Common Divisor Problem, Hidden Subset Sum Problem

Date: received 9 Nov 2021

Contact author: notarnicola luca at internet lu, gabor wiese at uni lu

Available format(s): PDF | BibTeX Citation

Version: 20211115:124908 (All versions of this report)

Short URL: ia.cr/2021/1491


[ Cryptology ePrint archive ]