**New Digital Signature Algorithm EHT**

*Igor Semaev*

**Abstract: **Every public-key encryption/decryption algorithm where the set of possible plain-texts is identical to the set of possible cipher-texts may be converted into a digital signature algorithm. That is quite different in the lattice (code)-based public-key cryptography. The decryption algorithm on a random input produces a valid plain-text, that is a signature, with a negligible probability. That explains why it is so difficult to construct a new secure and efficient lattice-based digital signature system. Though several solutions are known and taking part in the NIST Post Quantum Standardisation Process there is still a need to construct digital signature algorithms based on new principles. In this work, a new and efficient digital signature algorithm is suggested. Its design is simple and transparent. Its security is based on the hardness of an approximate closest vector problem in the maximum norm for some q-ary lattices. The complexity parameters are comparable with those of the round 3 NIST digital signature candidates.

**Category / Keywords: **public-key cryptography / matrices, linear inequalities, digital signatures, q-ary lattices

**Date: **received 11 Mar 2022

**Contact author: **igor at ii uib no

**Available format(s): **PDF | BibTeX Citation

**Version: **20220314:115320 (All versions of this report)

**Short URL: **ia.cr/2022/339

[ Cryptology ePrint archive ]