GB/T 15843.4-2008 (GB/T 15843.4-2024 Newer Version) PDF English
Search result: GB/T 15843.4-2008 (GB/T 15843.4-2024 Newer Version)
| Standard ID | Contents [version] | USD | STEP2 | [PDF] delivered in | Name of Chinese Standard | Status |
| GB/T 15843.4-2024 | English | 299 |
Add to Cart
|
3 days
|
Information technology - Security techniques - Entity authentication - Part 4: Mechanisms using a cryptographic check function
| Valid |
| GB/T 15843.4-2008 | English | 140 |
Add to Cart
|
0-9 seconds. Auto-delivery.
|
Information technology -- Security techniques -- Entity authentication -- Part 4: Mechanisms using a cryptographic check function
| Obsolete |
| GB/T 15843.4-1999 | English | 439 |
Add to Cart
|
3 days
|
Information technology-Security techniques-Entity authentication-Part 4: Mechanisms using a cryptographic check function
| Obsolete |
PDF Preview: GB/T 15843.4-2008
GB/T 15843.4-2008: PDF in English (GBT 15843.4-2008) GB/T 15843.4-2008
Information technology - Security techniques - Entity authentication - Part 4.Mechanisms using a cryptographic check function
ICS 35.040
L80
National Standards of People's Republic of China
Information technology security technology entity authentication
Part 4.Using the mechanism of password verification function
(ISO /IEC 9798-4..1999, IDT)
Released on.2008-06-19
Implementation of.2008-11-01
General Administration of Quality Supervision, Inspection and Quarantine of the People's Republic of China
Issued by China National Standardization Administration
Table of contents
Preface Ⅲ
Introduction Ⅳ
1 Scope 1
2 Normative references 1
3 Terms, definitions and symbols 1
4 Requirements 1
5 Mechanism 1
5.0 Overview 1
5.1 One-way authentication 2
5.1.1 One pass authentication 2
5.1.2 Two pass authentication 2
5.2 Mutual identification 3
5.2.1 Two-pass authentication 3
5.2.2 Three pass authentication 4
Appendix A (informative appendix) Use of text fields 5
Preface
GB/T 15843 "Information Technology Security Technical Entity Identification" is divided into five parts.
---Part 1.Overview
---Part 2.Mechanism of using symmetric encryption algorithm
---Part 3.Mechanism using digital signature technology
---Part 4.Using the mechanism of password verification function
---Part 5.The mechanism of adopting zero-knowledge technology
Other follow-up parts may be added in the future.
This part is Part 4 of GB/T 15843, which is equivalent to ISO /IEC 9798-4..1999 "Information Technology Security Technical Entities
Authentication Part 4.Mechanism of Using Password Verification Function", only for editorial modification.
This part replaces GB/T 15843.4-1999 "Information Technology Security Technical Entity Authentication Part 4.Using Password Verification Letter
Number Mechanism." Compared with GB/T 15843.4-1999, the main changes in this part are as follows.
--- This part deletes the ISO /IEC preface and adds an introduction.
--- This section is revised in accordance with GB/T 15843.1 to change some terms.
--- This part is consistent with ISO /IEC 9798-4..1999, and the 3.1, 3.2, and 3.3 in GB/T 15843.4-1999 are deleted.
--- This section deletes Appendix B, Appendix C, and Appendix D of GB/T 15843.4-1999, and uniformly uses GB/T 15843.1
Appendix B, Appendix C and references.
Appendix A of this section is an informative appendix.
This part is proposed and managed by the National Information Security Standardization Technical Committee.
The main drafting unit of this section. Data and Communication Protection Research and Education Center of the Chinese Academy of Sciences (State Key Laboratory of Information Security).
The main drafters of this section. Jing Jiwu, Lu Chunli, Xia Luning, Gaoneng, Xiang Ji.
The previous releases of the standards replaced by this part are.
---GB/T 15843.4-1999.
introduction
This part is equivalent to adopting the international standard ISO /IEC 9798-4..1999, which was developed by the ISO /IEC Joint Technical Committee JTC1 (Information Technology
Technology) Subcommittee SC27 (IT Security Technology) drafted.
This part defines the entity authentication mechanism using the cryptographic check function, which is divided into one-way authentication and mutual authentication. One-way identification
According to the number of message transmissions, it is divided into one-pass authentication and two-pass authentication; mutual authentication is divided into two according to the number of message transmissions
Pass authentication and three pass authentication.
For examples of password verification functions, see GB 15852.
All relevant content related to cryptographic algorithms in this section shall be implemented in accordance with relevant national regulations.
Information technology security technology entity authentication
Part 4.Using the mechanism of password verification function
1 scope
This section specifies the entity authentication mechanism using cryptographic verification functions. Two of them are the authentication of a single entity (one-way authentication).
The rest is the mutual authentication of the two entities.
The mechanisms specified in this section use time-varying parameters such as timestamps, serial numbers, or random numbers to prevent previously valid authentication information from being
Accepted or accepted multiple times.
If time stamps or serial numbers are used, only one transmission is required for one-way authentication, and two transmissions are required for mutual authentication. If you use
For the machine-number excitation-response method, one-way authentication requires two passes, and mutual authentication requires three passes.
See GB 15852 for examples of password verification functions.
2 Normative references
The clauses in the following documents become clauses of this part through reference in this part. For all dated reference documents, their subsequent
Some amendments (not including errata content) or revisions do not apply to this section. However, all parties who have reached an agreement based on this section are encouraged to study
Check whether the latest versions of these files can be used. For undated references, the latest version applies to this section.
3 Terms, definitions and symbols
The terms, definitions and symbols established in GB/T 15843.1-2008 apply to this section.
4 requirements
In the authentication mechanism specified in this section, the entity to be authenticated proves its identity by showing that it possesses a secret authentication key. This can
The entity uses its secret authentication key and password verification function to calculate a password verification value for the specified data. The password check value can be
Any other entity that has the entity’s secret authentication key to verify, other entities can recalculate the password verification value and compare it with the received value
Line comparison.
These authentication mechanisms have the following requirements. If any one of them is not met, the authentication process will be attacked or it will not succeed.
carry out.
a) The claimant who confirms its identity to the verifier shares a secret authentication key with the verifier. Before the formal launch of the authentication mechanism
Previously, this key should be known to all parties involved. The method of distributing keys to various entities is outside the scope of this section.
b) The secret authentication key shared by the claimant and the verifier should only be known to these two entities and other entities trusted by both parties.
c) The security strength of the mechanism depends on the length and security of the key, the characteristics of the password verification function, and the length of the password verification value.
These parameters should be carefully selected to meet the established security level. The selection of parameters and the security level may be specified in the security policy.
Exactly stipulated.
5 Mechanism
5.0 Overview
In these authentication mechanisms, entities A and B should share a secret key KB or two one-way secret keys before starting the authentication mechanism
KB and KBA. In the latter case, the one-way secret keys KB and KBA are used to authenticate A by B and A to B respectively.
Identify.
These mechanisms require the use of time-varying parameters such as timestamps, sequence numbers, or random numbers. The characteristics of these parameters, especially they are difficult to identify
The characteristics of repeated use during the life cycle of other keys are very important for the security of these mechanisms. For detailed information, see GB/T 15843.1-
Appendix B of.2008.
All text fields specified in the following mechanisms are also applicable to applications outside the scope of this section (text fields may be empty). they
The relationship and content of the depends on the specific application. See Appendix A for information on the use of text fields.
If the verifier can determine the text field independently, for example. the text field is known in advance, or sent in clear text, or can be
One or two of the sources are derived, the text field can only be included in the input of the password verification function.
5.1 One-way authentication
One-way authentication means that only one of the two entities is authenticated when using this mechanism.
5.1.1 One pass authentication
In this authentication mechanism, the claimant A initiates this process and the verifier B authenticates it. Uniqueness and timeliness are produced through
And check the time stamp or serial number (see Appendix B of GB/T 15843.1-2008) to control.
The authentication mechanism is shown in Figure 1.
5.1.2 Two pass authentication
In this authentication mechanism, the verifier B initiates this process and authenticates the claimant A. Uniqueness and timeliness is achieved through generation and
Check the random number RB (see Appendix B of GB/T 15843.1-2008) to control.
The authentication mechanism is shown in Figure 2.
Figure 2 Schematic diagram of two-pass one-way authentication mechanism
The token (TokenAB) sent by the claimant A to the verifier B is in the form.
TokenAB=Text3‖fKAB(RB‖B‖Text2)
Whether to include the distinguishable identifier B in TokenAB is optional.
Note. The distinguishable identifier B is included in TokenAB to prevent so-called reflection attacks. The characteristic of this attack is that the intruder fakes A will incentivize random
The number RB is reflected to B. The reason for including the distinguishable identifier B as an option is that the identifier B can be used in an environment where such attacks do not occur.
Omit.
If a one-way key is used, the distinguishable identifier B can also be omitted.
(1) B generates and sends a random number RB to A, and optionally sends a text field Text1.
(2) A generates and sends TokenAB to B.
(3) Once a message containing TokenAB is received, B is calculated
fKAB (RB‖B‖Text2)
And compare it with the password check value of the token, and verify the correctness of the distinguishable identifier B (if any) and the
(1) Whether the random number RB sent to A is consistent with the random number contained in TokenAB, so as to verify TokenAB.
5.2 Mutual identification
Mutual authentication means that two communicating entities use this mechanism to authenticate each other.
5.2.1 and 5.2.2 adopt the two mechanisms described in 5.1.1 and 5.1.2 to achieve mutual authentication. Both cases require
One pass is added, thereby adding two operating steps.
Note. The third mechanism of mutual authentication can be composed of two instances of the mechanism specified in 5.1.2, one is initiated by entity A and the other is initiated by entity B.
5.2.1 Two pass authentication
In this authentication mechanism, the uniqueness and timeliness are achieved by generating and verifying the time stamp or serial number (see the attachment of GB/T 15843.1-2008).
Record B) to control.
The authentication mechanism is shown in Figure 3.
5.2.2 Three pass authentication
In this mutual identification mechanism, uniqueness and timeliness are generated and tested by random numbers (see Appendix B of GB/T 15843.1-2008)
To control it.
The authentication mechanism is shown in Figure 4.
If a one-way key is used, the distinguishable identifier B can also be omitted.
(1) B generates and sends a random number RB to A and optionally sends a text field Text1.
(2) A generates and sends random number RA and token TokenAB to B.
(3) Once a message containing TokenAB is received, B is calculated
fKAB (RA‖RB‖B‖Text2)
And compare it with the password check value of the token, and verify the correctness of the distinguishable identifier B (if any) and the
(1) Whether the random number RB sent to A is consistent with the random number contained in TokenAB, so as to verify TokenAB.
(4) B generates and sends TokenBA to A.
(5) Once a message containing TokenBA is received, A is calculated
fKAB (RB‖RA‖Text4)
And compare it with the cryptographic check value of the token, and verify whether the random number RB received from B in step (1) is
It is consistent with the random number in TokenBA, and whether the random number RA sent to B in step (2) matches the random number in TokenBA
Match, thereby verifying TokenBA.
If a one-way key is used, then the key KB in TokenBA will be replaced by the one-way key KBA, and use the corresponding one in step (5)
Key.
Appendix A
(Informative appendix)
Use of text fields
The tokens specified in Chapter 5 of this part include text fields. The actual use of different text fields and each text in a given pass
The relationship between the fields depends on the specific application.
For example, the appropriate text field, such as Text1 in TokenAB in 5.1.1, the information in it can be used to calculate the token
It is used for the password check value. In this way, you can provide data origin identification for information.
......
Source: Above contents are excerpted from the PDF -- translated/reviewed by: www.chinesestandard.net / Wayne Zheng et al.
|