Fast verification and public key storage optimization for unstructured lattice-based signatures - Faculté des Sciences de Sorbonne Université Access content directly
Journal Articles Journal of Cryptographic Engineering Year : 2023

Fast verification and public key storage optimization for unstructured lattice-based signatures

Abstract

A recent work of Sipasseuth, Plantard and Susilo proposed to accelerate lattice-based signature verifications and compress public key storage at the cost of a precomputation on a public key. This first approach, which focused on a restricted type of key, did not include most NIST candidates or most lattice representations in general. In this work, we first present a way to improve even further both their verification speed and their public key compression capability by using a generator of numbers that better suit the method needs. We then also generalize their framework to apply to q-ary lattice schemes as well as classical lattices using Hermite Normal Form, improving their security and applicable scope, thus exhibiting potential trade-offs to accelerate lattice-based signature verification in general and compression of the public key on the verifier side for unstructured lattices.
Fichier principal
Vignette du fichier
2022_Journal_of_Cryptographic_Engineering_Probabilistic_Verification-2.pdf (524.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03959746 , version 1 (02-02-2023)

Identifiers

Cite

Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth. Fast verification and public key storage optimization for unstructured lattice-based signatures. Journal of Cryptographic Engineering, 2023, Journal of Cryptographic Engineering (2023), ⟨10.1007/s13389-023-00309-1⟩. ⟨hal-03959746⟩
50 View
78 Download

Altmetric

Share

Gmail Facebook X LinkedIn More