Name
Abstract | ||
|---|---|---|
Following Schnorr framework for obtaining digital signatures, Song et al. recently proposed a new instantiation of a signature scheme featuring small public keys from coding assumptions in rank metric, which was accepted at PKC’19. Their proposal makes use of rank quasi-cyclic (RQC) codes to reduce the public key size. We show that it is possible to turn a valid, legitimate signature into an efficiently solvable decoding problem, which allows to recover the randomness used for signing and hence the secret key, from a single signature, in about the same amount of time as required for signing. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10623-019-00702-0 | Designs, Codes and Cryptography |
Keywords | DocType | Volume |
Post-quantum cryptography, Coding theory, Rank metric, RQC, Signature, Cryptanalysis, 94A60, 11T71, 14G50 | Journal | 88 |
Issue | ISSN | Citations |
4 | 0925-1022 | 0 |
PageRank | References | Authors |
0.34 | 13 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Aragon | 1 | 5 | 2.82 |
| Olivier Blazy | 2 | 198 | 16.48 |
| Jean-Christophe Deneuville | 3 | 16 | 3.08 |
| Philippe Gaborit | 4 | 700 | 56.29 |
| Terry Shue Chien Lau | 5 | 1 | 3.73 |
| Chik How Tan | 6 | 499 | 54.60 |
| Keita Xagawa | 7 | 258 | 20.51 |