### Learning strikes again: the case of the DRS signature scheme

Léo Ducas and Yang Yu

##### Abstract

Lattice signature schemes generally require particular care when it comes to preventing secret information from leaking through signature transcript. For example, the Goldreich-Goldwasser-Halevi (GGH) signature scheme and the NTRUSign scheme were completely broken by the parallelepiped-learning attack of Nguyen and Regev (Eurocrypt 2006). Several heuristic countermeasures were also shown vulnerable to similar statistical attacks. At PKC 2008, Plantard, Susilo and Win proposed a new variant of GGH, informally arguing resistance to such attacks. Based on this variant, Plantard, Sipasseuth, Dumondelle and Susilo proposed a concrete signature scheme, called DRS, that is in the round 1 of the NIST post-quantum cryptography project. In this work, we propose yet another statistical attack and demonstrate a weakness of the DRS scheme: one can recover some partial information of the secret key from sufficiently many signatures. One difficulty is that, due to the DRS reduction algorithm, the relation between the statistical leak and the secret seems more intricate. We work around this difficulty by training a statistical model, using a few features that we designed according to a simple heuristic analysis. While we only recover partial secret coefficients, this information is easily exploited by lattice attacks, significantly decreasing their complexity. Concretely, we claim that, provided that 100 000 signatures are available, the secret key may be recovered using BKZ-138 for the first set of DRS parameters submitted to the NIST. This puts the security level of this parameter set below 80-bits (maybe even 70-bits), to be compared to an original claim of 128-bits. Furthermore, we review the DRS v2 scheme that is proposed to resist above statistical attack. For this countermeasure, while one may not recover partial secret coefficients exactly by learning, it seems feasible to gain some information on the secret key. Exploiting this information, we can still effectively reduce the cost of lattice attacks.

Note: This is an extended version of the conference paper. New material has been added as Section 6, treating the application of our technique to the second version of DRS.

Available format(s)
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in ASIACRYPT 2018
Keywords
CryptanalysisLattice based signatureStatistical attackLearningBDD
Contact author(s)
ducas @ cwi nl
yang yu0986 @ gmail com
History
2019-11-18: last of 4 revisions
See all versions
Short URL
https://ia.cr/2018/294

CC BY

BibTeX

@misc{cryptoeprint:2018/294,
author = {Léo Ducas and Yang Yu},
title = {Learning strikes again: the case of the DRS signature scheme},
howpublished = {Cryptology ePrint Archive, Paper 2018/294},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/294}},
url = {https://eprint.iacr.org/2018/294}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.