Cryptology ePrint Archive: Report 2020/905

Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework

Marco Baldi and Karan Khathuria and Edoardo Persichetti and Paolo Santini

Abstract: In this paper we cryptanalyze a recently proposed signature scheme consisting in a translation of the Lyubashevsky framework to the coding theory, whose security is based on the hardness of decoding low weight errors in the Hamming metric. We show that each produced signature leaks information about the secret key and that, after the observation of a bunch of signatures, the secret key can be fully recovered with simple linear algebra. We conservatively assess the complexity of our proposed attack and show that it grows polynomially in the scheme parameters; numerical simulations are used to confirm our analysis. Our results show that the weakness of the scheme is intrinsic by design, and that security cannot be restored by a mere change in the parameters.

Category / Keywords: public-key cryptography /

Date: received 17 Jul 2020

Contact author: p santini at staff univpm it,m baldi@staff univpm it,karan khathuria@math uzh ch,epersichetti@fau edu

Available format(s): PDF | BibTeX Citation

Version: 20200718:161507 (All versions of this report)

Short URL: ia.cr/2020/905


[ Cryptology ePrint archive ]