| 摘要 |
PROBLEM TO BE SOLVED: To authenticate two parties which are communicating to each other by verifying the 1st party based on the 1st challenge and 2nd challenge answer. SOLUTION: A party (AC/HLR) 10 generates a random number RN and sends it to a party (mobile machine) 20. The machine 20 generates the count value CM and executes an encipherment function with key (KCF) by using an M-key as its key in regard to the number RN, value CM, type data TYPE and id data IDM. Then the machine 20 transmits the value CM and a challenge answer KCFM-key (Type, IDM, CM, RN) to a network. The AC/HLR 10 calculates the KCFM-key (Type, IDM CM, RN). If this calculated value is coincident with the version that is received from the machine 20, the SC/HLR 10 authenticates the machine 20. Then the machine 20 calculates the KCFM-key (Type, IDM, CM) and verifies whether or not a version is coincident with the version sent from the AC/HLR 10.
|
