Powered by Google-Search & Google-Books www.ChineseStandard.net Database: 169760 (Feb 27, 2021)
HOME   Quotation   Tax   Examples Standard-List   Contact-Us   View-Cart

GM/T 0001.1-2012

Chinese Standard: 'GM/T 0001.1-2012'
Standard IDContents [version]USDSTEP2[PDF] delivered inStandard Title (Description)StatusRelated Standard
GM/T 0001.1-2012English150 Add to Cart 0--10 minutes. Auto immediate delivery. ZUC stream cipher algorithm--Part 1: Description of the algorithm Valid GM/T 0001.1-2012
GM/T 0001.1-2012Chinese20 Add to Cart <=1-day [PDF from Chinese Authority, or Standard Committee, or Publishing House]  

  In 0~10 minutes time, full copy of this English-PDF will be auto-immediately delivered to your email. See samples for translation quality.  

Standard ID GM/T 0001.1-2012 (GM/T0001.1-2012)
Description (Translated English) ZUC stream cipher algorithm--Part 1: Description of the algorithm
Sector / Industry Chinese Industry Standard (Recommended)
Classification of Chinese Standard L80
Word Count Estimation 17,158
Date of Issue 2012/3/21
Date of Implementation 2012/3/21

GM/T 0001.1-2012
ICS 35.040
L 80
RECORD NO.. 36822-2012
ZUC stream cipher algorithm -
Part 1. Description of the algorithm
第 1部分. 算法描述
Issued by. State Cryptography Administration of the People’s Republic of
How to BUY & immediately GET a full-copy of this standard?
2. Search --> Add to Cart --> Checkout (3-steps);
3. No action is required - Full-copy of this standard will be automatically &
immediately delivered to your EMAIL address in 0~60 minutes.
Table of Contents
Foreword ... 3 
1 Scope .. 4 
2 Terms and conventions ... 4 
3 Symbols and abbreviations ... 5 
4 Description of algorithm ... 6 
Annex A (Normative) S-box ... 11 
Annex B (Informative) Implementation of modulo 231 - 1 multiplication and
modulo 231 - 1 addition ... 13 
Annex C (Informative) Algorithmic calculation examples ... 14 
Bibliography ... 18 
GM/T 0001, ZUC stream cipher algorithm, comprises three parts.
-- Part 1. Description of algorithm;
-- Part 2. The ZUC-based confidentiality algorithm;
-- Part 3. The ZUC-based integrity algorithm.
This Part is Part 1 of GM/T 0001.
This Part of GM/T 0001 is drafted in accordance with the rules given in GB/T 1.1-2009.
This Part is maintained consistent with the 3GPP LTE confidentiality and integrity
algorithms standard, ZUC specification (ETSI/SAGE TS 35.222).
Attention is drawn to the possibility that some of the elements of this document may
be the subject of patent rights. The issuer of this document shall not be held
responsible for identifying any or all such patent rights.
Annex A to this Part is normative; and Annex B and Annex C are informative.
This Part was proposed by and shall be under the jurisdiction of State Cryptography
The drafting organizations of this Part. Institute of Software Chinese Academy of
Sciences, The Data Assurance and Communication Security Research Center of
Chinese Academy of Sciences.
The main drafters of this Part. Feng Dengguo, Lin Dongyue, Feng Xiutao, Zhou
ZUC stream cipher algorithm -
Part 1. Description of the algorithm
1 Scope
This Part of GM/T 0001 describes ZUC stream cipher algorithm, which can be used as
guidance for the development, testing and use of ZUC stream cipher algorithm related
2 Terms and conventions
For the purposes of this Part, the following terms and conventions apply.
Binary characters 0 and 1 are called bits.
Bit string which comprises 8 bits, is called byte.
Bit strings which comprise not less than 2 (including 2) bits, are called words.
This Part mainly adopts 31-bit words and 32-bit words.
word representation
The words of this Part are represented in decimal by default. When the words are
represented in other systems, indicators are always added before or after word
representations. For example. the prefix 0x indicates that the word is represented in
the hexadecimal format; and the suffix subscript 2 indicates that the word is
represented in the binary format.
bit ordering
This Part specifies that the most significant bit is located on the leftmost of word
representations; and that the least significant bit is located on the rightmost of word
3 Symbols and abbreviations
3.1 Operation notations
Arithmetic addition operation
Integer complementation operation
Bitwise exclusive-OR operation
Modulo 232 addition algorithm
Concatenation of strings
Select the most significant 16 bits of words
Select the least significant 16 bits of words
Left-shift of 32-bit words by k bits
Right-shift of 32-bit words by k bits
Assignment of vector a to vector b, i.e. assignment according to
3.2 Symbols
The following symbols apply to this Part.
sixteen 31-bit register element variables of linear
Four 32-bit words from the output of bit reconstruction
Two 32-bit memory element variables of non-linear function F
32-bit words from the output of non-linear function F
32-bit key words from each beat of output of algorithm
Initial seed key
Initial vector
String constant used for initialization of algorithm
3.3 Abbreviations
The following abbreviations a......
Related standard: GM/T 0001.2-2012    GM/T 0001.3-2012