Mobile phone shield signed key protection method
A signature key and mobile phone shield technology, applied in the field of information security, can solve the problems of increased risk, security dependence of signature fragment transmission, and inability to guarantee, and achieve the effect of exemption from dependence
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0027] A mobile phone shield client signature method provided by the embodiment of the present invention, the process is as follows figure 1 shown, including the following steps:
[0028] Step1. The mobile shield client pre-creates a set number of processes participating in the signature, and sets the processes to be executed by the server. In this field, the concept of process refers to the execution entity routine of the shard signature algorithm in the threshold signature process. Except for the processes executed by the server, other processes are executed by the Mobile Shield client.
[0029] According to the preset threshold (T, N), create N processes that may participate in the signature; by default, process 1 will be run by the server, and the rest of the processes will be in the mobile shield client. It is also assumed that, only and only during the execution of the algorithm, the channel between No. 2 to No. N processes and the parent process, that is, the mobile s...
Embodiment 2
[0052] An embodiment of the present invention based on elliptic curves (refer to commercial secret standard SM2) is given below.
[0053] Algorithm 1. System setup Algorithm Setup, executed by the server, is used to select appropriate system parameters and system master keys according to the requirements of the system security level (characterized by the key length L by default). The algorithm consists of the following steps:
[0054] Step 1: Select elliptic curve parameters p, a, b, n (refer to standard SM2);
[0055] Step 2: Select the x-coordinate Gx and y-coordinate Gy of the elliptic curve generation point G (refer to standard SM2);
[0056] Step 3: Select a L-bit random number s as the master key, and calculate the public point PP=[s]G, where [s]G represents s times of self-addition of G (refer to standard SM2 for the fast calculation process).
[0057] Step 4: Output system public parameters (p, a, b, n, Gx, Gy, PP) and system master key s.
[0058] Algorithm 2. Blin...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
