Public key encryption and decryption method and digital signature method thereof
An encryption, decryption, and public key technology, applied in the field of information security, can solve problems such as inability to resist linearized equation attacks and differential attacks
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2011-02-16
- Estimated Expiration
- Not applicable · inactive patent
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The invention belongs to the technical field of information security, and in particular relates to a public key encryption and decryption method and a corresponding digital signature method. Background technique
[0002] The development of quantum computers poses a great threat to traditional public key cryptosystems (such as RSA, ElGamal, etc.). For this reason, public-key cryptography that is resistant to quantum computer attacks has received extensive attention. How to design a public-key cryptography system that can resist quantum computer attacks is an important problem to be solved in the field of information security technology. The public key cryptography proposed to resist the Shor quantum algorithm attack mainly includes three types: NTRU, OTU2000 and multivariate quadratic polynomial (MQ for short) public key cryptography. NTRU has registered patents in many countries. During the Tenth Five-Year Period, my country also carried out theoretic...
Examples
Embodiment 1
[0079] (I) Establish the system: first use the basic domain F 2 = {0, 1} to construct small and large fields: small field F 8 =F 2 [X] / (X 3 +X+1), big field F 8 3 = F 8 [ X ] / ( X 3 + X + 1 ) , Then define F 8 3 arrive a bijection of ∀ w = ( w 0 , w 1 , w 2 ) ∈ F 8 3 , So it is possible to pass the bijection small field F 8 He Dayu Element conversion between.
[0080] The reversible linear transformation component adopts the sma...
Embodiment 2
[0101] Example 2 gives a security of at least 2 80 An efficient signature scheme for :
[0102] System parameters: select parameters k=5, n=37, θ=7, r=16, select SHA-1 for the Hash function, and the output length of SHA-1 is 160 bits. So q=2 k = 32, construct the middle domain F 32 He Dayu f 32 =F 2 [x] / (x 5 +x 2 +1), F 32 37 = F 32 [ x ] / ( x 37 + x 12 + x 10 + x 2 + 1 ) . Then generate an 80-bit random seed Seed and in the middle field F 32 Randomly generate two affine bijective U, T, then the system private key is {T -1 , U -1 , Seed} requires 1.72Kbytes of storage...