Paper 2020/1015

On Multivariate Algorithms of Digital Signatures of Linear Degree and Low Density.

Vasyl Ustimenko

Abstract

Multivariate cryptography studies applications of endomorphisms of K[x_1, x_2, …, x_n] where K is a finite commutative ring. The importance of this direction for the construction of multivariate digital signature systems is well known. We suggest modification of the known digital signature systems for which some of cryptanalytic instruments were found . This modification prevents possibility to use recently developed attacks on classical schemes such as rainbow oil and vinegar system, and LUOV. Modification does not change the size of hashed messages and size of signatures. Basic idea is the usage of multivariate messages of unbounded degree and polynomial density for the construction of public rules. Modified algorithms are presented for standardization and certification studies.

Note: Note presents idea to combine bijective multivariate map of linear degree and density O(1) with quadratic multivariate public rule of digital signature.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
multivariate cryptographymultivariate digital signature systemsunbounded degreestandardisation.
Contact author(s)
vasyl @ hektor umcs lublin pl
History
2020-08-22: received
Short URL
https://ia.cr/2020/1015
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/1015,
      author = {Vasyl Ustimenko},
      title = {On Multivariate Algorithms of Digital Signatures of Linear Degree and Low Density.},
      howpublished = {Cryptology ePrint Archive, Paper 2020/1015},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/1015}},
      url = {https://eprint.iacr.org/2020/1015}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.