SM9 digital signature collaborative generation method and system with product r parameter
A digital signature and product technology, 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
[0104] This embodiment concerns two devices designated No. 1 and No. 2, respectively.
[0105] During the initialization phase, knowing d A The device randomly selects an integer c and an integer b in [1,n-1], and calculates P A =[c -1 ]d A , P B =[b]d A , g B =g^(bc); c is kept as a secret by No. 1 device, P A It is kept as a secret by the No. 2 device; b, d A Destroy;P B and g B Used by the device that needs to be used.
[0106] here to know d A The device is one of the No. 1 and No. 2 devices, or a device other than the two devices (such as an identification private key generation system, other key service systems).
[0107] When it is necessary to use the user's SM9 identification private key d A When performing a digital signature on the message M, the two devices generate a digital signature on the message M according to the scheme 1 of the aforementioned SM9 digital signature collaborative generation method.
Embodiment 2
[0109] This embodiment concerns two devices designated No. 1 and No. 2, respectively.
[0110] During the initialization phase, knowing d A The device randomly selects an integer c and an integer b in [1,n-1], and calculates P A =[c -1 ]d A , P B =[b]d A , g B = g^b; P A It is kept as a secret by No. 1 device, c is kept as a secret by No. 2 device; b, d A Destroy;P B and g B Used by the device that needs to be used.
[0111] here to know d A The device is one of the No. 1 and No. 2 devices, or a device other than the two devices (such as an identification private key generation system, other key service systems).
[0112] When it is necessary to use the user's SM9 identification private key d A When digitally signing the message M, the two devices generate a digital signature for the message M according to the second scheme of the aforementioned SM9 digital signature collaborative generation method.
Embodiment 3
[0114] This embodiment concerns two devices designated No. 1 and No. 2, respectively.
[0115] During the initialization phase, knowing d A The device randomly selects an integer c and an integer b in [1,n-1], and calculates P B =[c -1 b]d A , g B =g^b;
[0116] After that, randomly select two integers c in [1,n-1] 1 、c 2 and (c 1 +c 2 )mod n≠0, then calculate d A1 =[c 1 (c 1 +c 2 ) -1 ]d A , d A2 =[c 2 (c 1 +c 2 ) -1 ]d A , where (c 1 +c 2 ) -1 is (c 1 +c 2 ) modulo n multiplicative inverse;
[0117] or, know d A The device randomly selects an integer t in [2,n-1], and then calculates d A1 =[t]d A , d A2 = d A -d A1 ;
[0118] or, know d A The device randomly selects an integer t in [1,n-1], and then calculates d A1 =[t]P 1 , d A2 = d A -d A1 , where P 1 is the group G in the SM9 bilinear map 1 generator of ; if d A2 is zero, then reselect t and recalculate d A1 、d A2 , until d A2 not zero;
[0119] calculated d A1 、d A2 After th...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More