Cryptology ePrint Archive: Report 2021/1623

On the Short Principal Ideal Problem over some real Kummer fields

Andrea Lesavourey and Thomas Plantard and Willy Susilo

Abstract: Several cryptosystems using structured lattices have been believed to be quantum resistant. Their security can be linked to the hardness of solving the Shortest Vector Problem over module or ideal lattices. During the past few years it has been shown that the related problem of finding a short generator of a principal ideal can be solved in quantum polynomial time over cyclotomic fields, and classical polynomial time over a range of multiquadratic and multicubic fields. Hence, it is important to study as many as possible other number fields, to improve our knowledge of the aformentioned problems. In this paper we generalise the work done over multiquadratic and multicubic fields to a larger range of real Kummer extensions of prime exponent p. Moreover, we extend the analysis by studying the Log-unit lattice over these number fields, in comparison to already studied fields.

Category / Keywords: public-key cryptography / Post-quantum cryptography, Ideal lattices, Short Principal Ideal Problem, Kummer fields, Log-units

Date: received 13 Dec 2021

Contact author: andrea lesavourey at irisa fr

Available format(s): PDF | BibTeX Citation

Note: Code in support of the article can be found at https://github.com/AndLesav/spip-on-kummer

Version: 20211214:094339 (All versions of this report)

Short URL: ia.cr/2021/1623