Flash, a fast multivariate signature algorithm

88Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article describes the particular parameter choice and implementation details of one of the rare published, but not broken signature schemes, that allow signatures to be computed and checked by a low-cost smart card. The security is controversial, since we have no proof of security, but the best known attacks require more than 280 computations. We called FLASH our algorithm and we also proposed SFLASH, a version that has a smaller public key and faster verification though one should be even more careful about it’s security. FLASH and SFLASH have been accepted as submissions to NESSIE (New European Schemes for Signatures, Integrity, and Encryption), a project within the Information Societies Technology (IST) Programme of the European Commission. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Patarin, J., Courtois, N., & Goubin, L. (2001). Flash, a fast multivariate signature algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020, 298–307. https://doi.org/10.1007/3-540-45353-9_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free