This part of GM/T 0003 specifies the public key encryption algorithm for the public key cryptographic algorithm SM2 based on elliptic curves, and gives examples of message encryption and decryption and their corresponding processes.
This part is applicable to the message encryption and decryption in the commercial cypher application, the message sender can encrypt the message with the receiver’s public key and the receiver decrypts with corresponding private key to obtain the message. Meanwhile, this part also can provide standard setting and standardization reference with regard to products and technologies for security product manufacturers, and improve the credibility and interoperability of security products.
2 Normative References
The following referenced documents are indispensable for the application of this document. For dated references, only the edition cited applies. For undated references, the latest edition of the referenced document (including any amendments) applies.
GM/T 0003.1-2012 Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves - Part 1: General
3 Terms and Definitions
For the purpose of this standard, the following terms and definitions apply.
3.1
secret key
a kind of key that is shared by the sender and the receiver and is not known to the third party in the cryptosystem
3.2
message
a bit string with any finite length
3.3
key derivation function
a function that generates one or more shared secret keys by acting on the shared secret and other parameters known to both parties
Foreword i 1 Scope 2 Normative References 3 Terms and Definitions 4 Symbols 5 Algorithm Parameters and Auxiliary Functions 5.1 General 5.2 Elliptic Curve System Parameters 5.3 User Key Pair 5.4 Auxiliary Functions 5.4.1 General 5.4.2 Cryptographic Hash Function 5.4.3 Key Derivation Function 5.4.4 Random Number Generator 6 Encryption Algorithm and its Process 6.1 Encryption Algorithm 6.2 Encryption Algorithm Process 7 Decryption Algorithm and its Process 7.1 Decryption Algorithm 7.2 Decryption Algorithm Process Annex A (Informative) Examples of Message Encryption and Decryption A.1 General Requirements A.2 Elliptic Curve Message Encryption and Decryption on Fp A.3 Elliptic Curve Message Encryption and Decryption on
Standard
GM/T 0003.4-2012 Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves - Part 4: Public Key Encryption Algorithm (English Version)
Standard No.
GM/T 0003.4-2012
Status
valid
Language
English
File Format
PDF
Word Count
7500 words
Price(USD)
140.0
Implemented on
2012-3-21
Delivery
via email in 1 business day
Detail of GM/T 0003.4-2012
Standard No.
GM/T 0003.4-2012
English Name
Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves - Part 4: Public Key Encryption Algorithm
1 Scope
This part of GM/T 0003 specifies the public key encryption algorithm for the public key cryptographic algorithm SM2 based on elliptic curves, and gives examples of message encryption and decryption and their corresponding processes.
This part is applicable to the message encryption and decryption in the commercial cypher application, the message sender can encrypt the message with the receiver’s public key and the receiver decrypts with corresponding private key to obtain the message. Meanwhile, this part also can provide standard setting and standardization reference with regard to products and technologies for security product manufacturers, and improve the credibility and interoperability of security products.
2 Normative References
The following referenced documents are indispensable for the application of this document. For dated references, only the edition cited applies. For undated references, the latest edition of the referenced document (including any amendments) applies.
GM/T 0003.1-2012 Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves - Part 1: General
3 Terms and Definitions
For the purpose of this standard, the following terms and definitions apply.
3.1
secret key
a kind of key that is shared by the sender and the receiver and is not known to the third party in the cryptosystem
3.2
message
a bit string with any finite length
3.3
key derivation function
a function that generates one or more shared secret keys by acting on the shared secret and other parameters known to both parties
Contents of GM/T 0003.4-2012
Foreword i
1 Scope
2 Normative References
3 Terms and Definitions
4 Symbols
5 Algorithm Parameters and Auxiliary Functions
5.1 General
5.2 Elliptic Curve System Parameters
5.3 User Key Pair
5.4 Auxiliary Functions
5.4.1 General
5.4.2 Cryptographic Hash Function
5.4.3 Key Derivation Function
5.4.4 Random Number Generator
6 Encryption Algorithm and its Process
6.1 Encryption Algorithm
6.2 Encryption Algorithm Process
7 Decryption Algorithm and its Process
7.1 Decryption Algorithm
7.2 Decryption Algorithm Process
Annex A (Informative) Examples of Message Encryption and Decryption
A.1 General Requirements
A.2 Elliptic Curve Message Encryption and Decryption on Fp
A.3 Elliptic Curve Message Encryption and Decryption on
