Blind signcryption method under lattice public key cryptosystem
A technology of public key cryptography and blind signature, applied in the field of lattice public key cryptography or blind sign cryptography, and cryptography, can solve problems such as excessive bilinear pairing operations, abnormal scheme signatures, and low computational efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0076] In this embodiment, the large prime number q is 2 128 For example, in figure 1 Among them, the blind signcryption method under the lattice public key system of this embodiment consists of the following steps:
[0077] A. System initialization
[0078] (A1) Trusted party defines modulo q residual class ring Z q The n-row nk-column matrix G, modulo q, is:
[0079] q=p v
[0080] Where p is a large prime number, v is a finite positive integer; in this embodiment, p is 2, and v is 128.
[0081] (A2) The trusted party defines three integers m 0 ,m,m 1 Dimensions to use as matrix-vectors.
[0082] (A3) The trusted party defines the error rate α∈(0,1) with error learning, and selects Gaussian parameters
[0083]
[0084] (A4) The trusted party defines the ring R:
[0085] R=Z q [x] / f(x)
[0086] where f(x) is a polynomial. f (x) of the present embodiment is:
[0087] f(x)=x n +a n x n-1 +…+a 2 x+a 1
[0088] The irreducible polynomial whose leading coeff...
Embodiment 2
[0144] In this embodiment, the large prime number q is 2 256 As an example, the blind signcryption method under the lattice public key system consists of the following steps:
[0145] A. System initialization
[0146] (A1) Trusted party defines modulo q residual class ring Z q The n-row nk-column matrix G, modulo q, is:
[0147] q=p v
[0148] Where p is a large prime number, v is a finite positive integer; in this embodiment, p is 2, and v is 256.
[0149] The other steps of this step are the same as in Example 1.
[0150] Other steps are identical with example 1.
Embodiment 3
[0152] In this embodiment, the large prime number q is 2 512 As an example, the blind signcryption method under the lattice public key system consists of the following steps:
[0153] A. System initialization
[0154] (A1) Trusted party defines modulo q residual class ring Z q The n-row nk-column matrix G on q is:
[0155] q=p v
[0156] Where p is a large prime number, v is a finite positive integer; in this embodiment, p is 2, and v is 512.
[0157] The other steps of this step are the same as in Example 1.
[0158] Other steps are identical with example 1.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com