FLASH, a Fast Multivariate Signature Algorithm

  • Authors:
  • Jacques Patarin;Nicolas Courtois;Louis Goubin

  • Affiliations:
  • -;-;-

  • Venue:
  • CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.