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. © IFIP International Federation for Information Processing 2013.
Author supplied keywords
Cite
CITATION STYLE
El Yousfi Alaoui, S. M., Cayrel, P. L., El Bansarkhani, R., & Hoffmann, G. (2013). Code-based identification and signature schemes in software. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8128 LNCS, pp. 122–136). https://doi.org/10.1007/978-3-642-40588-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
