Certificateless Network Coding Lattice Ring Signcryption Method
A technology of network coding and ring signcryption, which is applied in the field of lattice cryptography or certificateless ring signcryption, network coding and cryptography, and achieves the effect of high computing efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0085] Taking the value of the security parameter n as 128 and the value of the prime number q as 3 as an example, the certificateless network coding lattice ring signcryption method based on the certificate in this embodiment consists of the following steps (see figure 1 ):
[0086] A. System initialization
[0087] (A1) The key generation center selects the security parameter n and the prime number q, and determines the complexity function L as follows:
[0088]
[0089] Where n is a security parameter, q is a prime number, n≥128, and q is at least 3. In this embodiment, the value of n is 128, the prime number q is 3, and O(·) represents the time complexity.
[0090] (A2) The key generation center uses the trapdoor generation method to output the n-row m-column matrix A and lattice base B according to the input security parameters n, positive integer m, and prime number q:
[0091]
[0092] Where m>5nlogq, the value of n in this embodiment is 128, and the value of th...
Embodiment 2
[0162] Taking the value of the security parameter n as 256 and the value of the prime number q as 5 as an example, the certificateless network coding lattice ring signcryption method based on the present embodiment consists of the following steps:
[0163] A. System initialization
[0164] (A1) The key generation center selects the security parameter n and the prime number q, and determines the complexity function L as follows:
[0165]
[0166] Where n is a security parameter, and q is a prime number. In this embodiment, the value of n is 256, and the prime number q is 5. O(·) represents the time complexity.
[0167] (A2) The key generation center uses the trapdoor generation method to output a matrix A with n rows and m columns and a lattice base B according to the input security parameters n, positive integer m, and prime number q.
[0168]
[0169] Where m>5nlogq, the value of n in this embodiment is 256, and the value of the prime number q is 5.
[0170] (A3) The ...
Embodiment 3
[0239] Taking the value of the security parameter n as 512 and the value of the prime number q as 7 as an example, the certificateless network coding lattice ring signcryption method based on the present embodiment consists of the following steps:
[0240] A. System initialization
[0241] (A1) The key generation center selects the security parameter n and the prime number q, and determines the complexity function L as follows:
[0242]
[0243] Wherein n is a security parameter, q is a prime number, n≥128, and q is at least 3. The value of n in this embodiment is 512, the prime number q is 7, and O(·) represents the time complexity.
[0244] (A2) The key generation center uses the trapdoor generation method to output the n-row m-column matrix A and lattice base B according to the input security parameters n, positive integer m, and prime number q:
[0245]
[0246] Where m>5nlogq, the value of n in this embodiment is 512, and the value of the prime number q is 7.
[0...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


