arXiv · 1812.03286
Cryptanalysis of a One-Time Code-Based Digital Signature Scheme
Abstract
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. 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, which leads to a significant information leakage about the secret key.
Explore related subjects
Keep this discovery
Paolo Santini, Marco Baldi, Franco Chiaraluce. 2018-12-08. Cryptanalysis of a One-Time Code-Based Digital Signature Scheme. https://arxiv.org/abs/1812.03286
Cite the original work for its findings. Save a collection to share your selection of sources.