FLASH, a Fast Multivariate Signature Algorithm
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.
Unable to display preview. Download preview PDF.
- 1.Nicolas Courtois, Asymmetric cryptography with algebraic problems MQ, Min-Rank, IP and HFE. PhD thesis, Paris 6 University, to appear soon.Google Scholar
- 2.Tsutomu Matsumoto and Hideki Imai, Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption, Proceedings of EUROCRYPT’88, Springer-Verlag, pp. 419–453.Google Scholar
- 3.Jacques Patarin, Cryptanalysis of the Matsumoto and Imai public Key Scheme of Eurocrypt’88, Proceedings of CRYPTO’95, Springer-Verlag, pp. 248–26Google Scholar