Signature verification method based on Gaussian sampling

Abstract

The invention discloses a signature verification method based on Gaussian sampling. The problem that an existing signature technology based on Gaussian sampling is low in execution efficiency when the modulus is not the power of two is mainly solved. The signature verification method based on Gaussian sampling comprises the steps that (1) parameters are selected, a key production algorithm is used for generating a signature key sk and a verification key vk; (2) the signature key sk is used for generating a trap door matrix R' of an expanding matrix AM; (3) the trap door matrix R' of the expanding matrix AM is used for signing a selected signature message M to obtain the signature sign; (4) the verification key vk is used for verifying the validity of the signature sign. According to the signature verification method, the calculated amount of the signature verification method based on Gaussian sampling is greatly reduced through an aspherical basic Gaussian sampling algorithm, and the signature verification method can be used for generation of signature in public key codes based on grids and personal private keys in encryption based on identities.

Description

technical field [0001] The invention belongs to the technical field of information security, and further relates to a signature verification method, which can be used for signature in lattice-based public key cryptography and generation of personal private key in identity-based encryption. Background technique [0002] Human beings are about to enter the era of quantum information. Lattice-based public key cryptography, as a typical representative of post-quantum cryptography, that is, cryptography that resists quantum computing attacks, occupies an important position in the field of cryptography. Lattice-based public-key cryptography has special advantages: (1) Clear security proof, that is, good protocol properties. Lattice-hard problems have the property of worst-case to average-case reduction, which guarantees that solving a lattice-hard random instance is equivalent to solving the worst-case lattice-hard problem, a property not shared by other cryptographic archetypes. ...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to solve the problem of low execution efficiency when the modulus is not a power of 2 in the original Gaussian sampling algorithm, and propose a Gaussian sampling-based signature verification method with high execution efficiency, short running time, and small storage space occupation. To reduce the time overhead and storage space consumption of signature generation

Images