Paper 2020/1015 Original: eprint.iacr.org/2020/1015 ↗
On Multivariate Algorithms of Digital Signatures of Linear Degree and Low Density.
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2020-08-22: last updated
- 2020-08-22: published
- Short URL
- https://ia.cr/2020/1015
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2020/1015}
}