Code-Based Identification and Signature Schemes in Software
Abstract
In this paper we present efficient implementations of several code-based identification schemes, namely the Stern scheme, the Véron scheme and the Cayrel-Véron-El Yousfi scheme. We also explain how to derive and implement signature schemes from the previous identification schemes using the Fiat-Shamir transformation. For a security of 80 bits and a document to be signed of size 1 kByte, we reach a signature in about 4 ms on a standard CPU.
Fichier principal
2013_-_Code-based_identification_and_signature_schemes_in_software.pdf (184.8 Ko)
Télécharger le fichier
| Origin | Files produced by the author(s) |
|---|
Loading...