On the (In)security of optimized Stern-like signature schemes
Andr\'e Chailloux, Simona Etinski

TL;DR
This paper analyzes the security vulnerabilities of optimized Stern-like signature schemes, demonstrates an attack on certain parameters, and proposes a simple fix that restores security with minimal signature size increase.
Contribution
It identifies a security flaw in optimized Stern schemes and introduces a practical fix that maintains security while only slightly increasing signature size.
Findings
An attack breaks some optimized schemes in time $O(2^{rac{eta}{2}})$.
Adding a salt and modifying pseudo-random string generation fixes the security flaw.
The fix preserves bits of security and minimally increases signature size.
Abstract
Stern's signature scheme is a historically important code-based signature scheme. A crucial optimization of this scheme is to generate pseudo-random vectors and a permutation instead of random ones, and most proposals that are based on Stern's signature use this optimization. However, its security has not been properly analyzed, especially when we use deterministic commitments. In this article, we study the security of this optimization. We first show that for some parameters, there is an attack that exploits this optimization and breaks the scheme in time while the claimed security is bits. This impacts in particular the recent Quasy-cyclic Stern signature scheme [BGMS22]. Our second result shows that there is an efficient fix to this attack. By adding a string to the scheme, and changing slightly how the pseudo-random…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
