Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash

Nicolas T.  Courtois

Paper 2004/143 Original: eprint.iacr.org/2004/143 ↗

Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash

Nicolas T. Courtois

Abstract

This paper should be considered as a draft. Part of it is an extended version of the paper Generic Attacks and the Security of Quartz presented at PKC 2003 and at the second Nessie workshop. It also contains a lot of new material that is not published elsewhere: -(yet another) discussion about what is and what isn't a secure signature scheme -up-to-date security results fo Sflash and Quartz -new results on computational security of Sflash w.r.t algebraic relation attacks in the light of Faugère-Joux Crypto 2003 paper. -and more... Comments are welcome !

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2005-06-15: last updated; 2004-06-18: published
Short URL: https://ia.cr/2004/143
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/143,
      author = {Nicolas T.  Courtois},
      title = {Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/143},
      year = {2004},
      url = {https://eprint.iacr.org/2004/143}
}