Prime order elliptic curve generation method and system for signature and key exchange
An elliptic curve and key exchange technology, which is applied in the field of prime number order elliptic curve generation method and system, can solve the problems of low efficiency and achieve the effect of high security
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0064] The prime number order elliptic curve generation method used for signature and key exchange in this embodiment, the prime number order elliptic curve is used to sign the file together with the private key of the sender, and the receiver uses the shared public key and prime number order Elliptic curve to verify the validity of the signature.
[0065] In specific implementation, in addition to solving the quadratic remaining 2 roots, the present embodiment only needs to find the 3 k + 1 type prime numbers of the 3 remaining 3 roots, that is, gcd (n, p-1)=3, so only It is necessary to give an algorithm for solving the three remaining cubic roots.
[0066] ① Algorithm for finding the 2nd root of the quadratic remainder:
[0067] Input: prime numbers p and
[0068] output: minimal make x 2 ≡a(modp) or "a is not a quadratic remainder modulo p".
[0069] Step 1: Input prime numbers p and a.
[0070] Step 2: Use Euclidean algorithm and Miller algorithm to check whether...
Embodiment 2
[0152] This embodiment provides a prime number order elliptic curve generation system for signature and key exchange. The prime number order elliptic curve is used to sign files together with the sender's private key, and the receiver uses the shared public key and prime number order elliptic curve to verify the validity of the signature; the prime number order elliptic curve generation system for signature and key exchange includes:
[0153] A large prime number generation module, which is used to generate a large prime number p of the 3k+1 type with a specified number of digits n and a sparse representation;
[0154] Large prime factorization module for decomposing p into p=c 2 -cd+d 2 of the form, where c≡2(mod 3), d≡0(mod 3);
[0155] A prime number judging module, which is used to judge the following n i , whether there is a prime number in 1≤i≤6, if not, regenerate p:
[0156] no 1 :=p+1-d+2c,n 2 :=p+1+c+d, n 3 :=p+1-c+2d,
[0157] no 4 :=p+1+d-2c,n 5 :=p+1-c-d...
Embodiment 3
[0162] This embodiment provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method for generating a prime order elliptic curve for signature and key exchange as described in the first embodiment above is implemented in the steps.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


