SM9 digital signature collaborative generation method and system by means of intermediate parameters
A technology of digital signature and intermediate parameters, applied in the field of information security
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0118] In this embodiment, there are two devices labeled No. 1 and No. 2. The No. 1 device stores the integer secret c in the interval [1, n-1] 1 , the No. 2 device saves the integer secret c in the interval [1,n-1] 2 , where n is the group G in the SM9 cryptographic algorithm 1 , G 2 , G T The order (is a prime number);
[0119] (initialization phase) precomputed with:
[0120] P A =[c -1 ]d A , where d A Identify the private key for the user's SM9, c -1 is the modulo n multiplicative inverse of c, c=(c 1 c 2 ) mod n is an integer secret that is not kept by both devices;
[0121] P U =[u]d A , where u is an integer secret in the interval [1,n-1] that neither device holds;
[0122] u and c -1 Not necessarily different from each other (the two are different or the same);
[0123] g U =g ^ u, wherein ^ is exponentiation (exponentiation is carried out to the element in front of ^, and the number of times of exponentiation is behind ^), g=e (P 1 ,P pub ), P 1 f...
Embodiment 2
[0143] The difference between embodiment 2 and embodiment 1 is that c 1 It is non-secret, its value is 1 or other integers in [1,n-1] (other integers selected subjectively or randomly in [1,n-1]), P A The non-disclosure is kept as a secret by No. 1 device (of course if P U =P A , then P U is also not disclosed, and is kept as a secret by device No. 1), and P B ≠P A , other unchanged.
Embodiment 3
[0145] In this embodiment, there are m devices respectively labeled No. 1, No. 2, ..., to No. m devices, m≥2, and the device No. i stores an integer secret c in the interval [1, n-1] i , i=1,...,m, where n is the group G in the SM9 cryptographic algorithm 1 , G 2 , G T The order (is a prime number);
[0146] (initialization phase) precomputed with:
[0147] P A =[c -1 ]d A , where d A Identify the private key for the user's SM9, c -1 is the modulo n multiplicative inverse of c, c=(c 1 c 2 …c m )modn is an integer secret that m devices do not save;
[0148] P U =[u]d A , where u is an integer secret in the interval [1,n-1] that is not saved by m devices;
[0149] u and c -1 Not necessarily different from each other (the two are different or the same);
[0150] g U =g ^ u, wherein ^ is exponentiation (exponentiation is carried out to the element in front of ^, and the number of times of exponentiation is behind ^), g=e (P 1 ,P pub ), P 1 for G 1 generator in...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More