Recovering short generators of principal ideals in cyclotomic rings

Ronald Cramer, L. Ducas, Chris Peikert, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A handful of recent cryptographic proposals rely on the conjectured hardness of the following problem in the ring of integers of a cyclotomic number field: given a basis of a principal ideal that is guaranteed to have a “rather short” generator, find such a generator. Recently, Bernstein and Campbell-Groves-Shepherd sketched potential attacks against this problem; most notably, the latter authors claimed a polynomial-time quantum algorithm. (Alternatively, replacing the quantum component with an algorithm of Biasse and Fieker would yield a classical subexponential-time algorithm.) A key claim of Campbell et al. is that one step of their algorithm—namely, decoding the log-unit lattice of the ring to recover a short generator from an arbitrary one—is classically efficient (whereas the standard approach on general lattices takes exponential time). However, very few convincing details were provided to substantiate this claim. In this work, we clarify the situation by giving a rigorous proof that the log-unit lattice is indeed efficiently decodable, for any cyclotomic of prime-power index. Combining this with the quantum algorithm from a recent work of Biasse and Song confirms the main claim of Campbell et al. Our proof consists of two main technical contributions: the first is a geometrical analysis, using tools from analytic number theory, of the standard generators of the group of cyclotomic units. The second shows that for a wide class of typical distributions of the short generator, a standard lattice-decoding algorithm can recover it, given any generator. By extending our geometrical analysis, as a second main contribution we obtain an efficient algorithm that, given any generator of a principal ideal (in a prime-power cyclotomic), finds a 2Õ(√ n)-approximate shortest vector in the ideal. Combining this with the result of Biasse and Song yields a quantum polynomial-time algorithm for the 2Õ(√ n)-approximate Shortest Vector Problem on principal ideal lattices.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsMarc Fischlin, Jean-Sebastien Coron
PublisherSpringer Verlag
Pages559-585
Number of pages27
ISBN (Print)9783662498958
DOIs
StatePublished - 2016
Event35th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016 - Vienna, Austria
Duration: May 8 2016May 12 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9666
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other35th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016
CountryAustria
CityVienna
Period5/8/165/12/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Recovering short generators of principal ideals in cyclotomic rings'. Together they form a unique fingerprint.

  • Cite this

    Cramer, R., Ducas, L., Peikert, C., & Regev, O. (2016). Recovering short generators of principal ideals in cyclotomic rings. In M. Fischlin, & J-S. Coron (Eds.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 559-585). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9666). Springer Verlag. https://doi.org/10.1007/978-3-662-49896-5_20