[Resource Topic] 2020/905: Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework

Welcome to the resource topic for 2020/905

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

Authors: Marco Baldi, Karan Khathuria, Edoardo Persichetti, 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.

ePrint: https://eprint.iacr.org/2020/905

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .