Cryptanalysis of a One-Time Code-Based Digital Signature Scheme
share
In this paper, we consider a one-time digital signature scheme recently proposed by Persichetti and show that a successful key recovery attack can be mounted with limited complexity. The attack we propose exploits a single signature intercepted by the attacker, and relies on a statistical analysis performed over such a signature, followed by Information Set Decoding (ISD). We assess the attack complexity and show that a full recovery of the secret key can be performed with a work factor that is far below the claimed security level. The efficiency of the attack is motivated by the sparsity of the signature, jointly with the Quasi-Cyclic (QC) structure of the codes, which lead to a significant information leakage about the secret key.
READ FULL TEXT