Title of Invention

THE DYNAMIC IDENTFICATION METHOD WITHOUT INDENTIFICATION CODE

Abstract

A fully dynamic authentication method without identifier is disclosed in the present invention. The user's original identification code and authentication code having been encrypted dynamically will be transmitted by the user terminal to the server, and will be decrypted there for identification confirmation. In the authentication method of the invention, the identification code and authentication code are encrypted and decrypted unitedly. The results of each encryption are different from all the others and there is no a static identification code or feature to be identified each time the user's identification is authenticated, therefore the hacker would not be able to trace, record and analyze the user's authentication information. Thus actually the cracking object of the hacker has to be changed from the variation law of a single user to those of all users, which provides higher security.

Full Text

FORM-2 THE PATENTS ACT, 1970 COMPLETE SPECIFICATION [Section 10] 1. "THE DYNAMIC IDENTFICATION METHOD WITHOUT INDENTIFICATION CODE" 2. (a) CI, MengFu (b) 39#, Xin Kai Pu Road, Changsha City, Hunan Province 410009 Republic of China (c) Republic of China The following specification particularly describes the nature of the invention and the mannerin which it is to beperformed. GRANTED ORIGINAL 13 DEC 2004 268/MUMNP/2003 03-03-03 13-12-2004 The present invention involves a fully dynamic authentication without identifier, belongs to the information security field. Existing Technology Prior to the Invention For computer network user authentication, now generally the method of the static identification code (user name and series number etc.), combined with the password (the cryptogram set by the user) is used to confirm the user's identification. Whereas the US patent application No: 4720860 is for an apparatus for the electronic generation and comparison of non-predictable codes. The apparatus of the invention comprises a first mechanism for calculating a first non-predictable code according to a predetermined algorithm. Predetermined program and first static variable are stored in volatile memory which causes said program and static variable to be destroyed if an attempt is made to gain access thereto. Since the static identification code and password in this method remain unchanged during their transmit from the user's terminal to the server for identification authentication, they may be intercepted and captured by a certain hacker in the course of information transmit between the user's terminal and the server and may be utilized by the attacker to imitate an authorized user to beat. Aiming at eliminating this defect in the above static authentication, a new user authentication method has developed based on the above authentication method and the modification from static password to dynamic password (i.e. static identification code + dynamic password). Quite a few products based on this new authentication method have been launched to the market, such as the Dynamic ID card of two-factor authentication based on "cryptographic key - time (event)" provided by the RSA Security Incorporation, which will produce dynamic password automatically on different time for authentication. In fact, any user who uses the dynamic password for authentication will get his dynamic password variation based on a certain rule, and the hacker may makes use of the weakness that the static identification code remains unchanged to follow up and analyze it. He would be able to crack the variation law of the dynamic password and, after capturing enough information, mimic the authorized user to raise attacks. Purpose of the Invention The invention is to provide an authentication that the hacker could not trace and analyze. Technical Scheme of the Invention In the fully dynamic authentication method without identifier of the invention, the user's original identification code and authentication code having been encrypted dynamically will be transmitted by the user terminal to the server, and will be decrypted there for identification confirmation. In the authentication method of the invention, the identification code and authentication code are encrypted and decrypted unitedly. The results of each encryption are different from all the others and there is no a static identification code or feature to be identified each time the user's identification is authenticated, therefore the hacker would not be able to trace, record and analyze the user's authentication information. Thus actually the cracking object of the hacker has to be changed from the variation law of a single user to those of all users, which provides higher security. Description of Figure Figure 1 is the schematic diagram of the flow of the above authentication method of the invention. Embodiment Shown in Figure 1, the original codes are composed of identification codes I1, I2, ...Ik and authentication codes P1, P2, ...Pk' During authentication, the above original identification codes and authentication codes are encrypted, and a fully dynamic authentication code (M1, M2, ...Mk, Mk+1 Mk+2.... Mk+n) varying in each authentication is produced, and then the dynamic identification code (M1 M2, ...Mk, Mk+1, Mk+2,... Mk+n) is transmitted to the server. The fully dynamic identification code will be decrypted in the server and the original identification code I1, I2, ...Ik and the original authentication code P1, P2, ...PK will come out again for the corresponding authentication. The above encryption course may be set to be carried out by the encryption software or hardware in the user's terminal and any encryption technology may be adopted without any limitation to the encryption method. For instance, the dynamic encryption result may be got by varying encryption method in each authentication or by constant encryption method but varying cryptographic key in each authentication, or even by dynamic encryption method. On the other hand, the fully dynamic authentication code without identifier may be decrypted by the same encryption algorithm system in the server as used in the user's terminal, or by corresponding public cryptographic key in the server while the encryption is done by the private cryptographic key. The invention is not limited to the above embodiment. The core of the invention is: both the identification code and the authentication code are transformed into the fully dynamic identification code (both the original identification code and the authentication code do not exist any longer), which is transmitted to the server for authentication. Therefore, those authentication methods only by the remained dynamic identification code without authentication code shall belong to the protective scope of the invention. I Claim: 1. A method for generating a fully dynamic authentication code comprising the steps of: providing a user's original identification code and authentication code; encrypting the user's original identification code and authentication code dynamically in the user terminal to produce a fully dynamic authentication code; transmitting the fully dynamic authentication code to a server, and the fully dynamic authentication code without identifier will be decrypted in the server for identification confirmation. 2. The method of claim 1 further comprising the step of using the same dynamic encryption algorithm system in both a user's terminal and a server for encryption and decryption. Dated this 28th day of February 2003. Dr. Rajeshkumar H. Acharya Advocate & Patent Agent For and on Behalf of Applicant

Documents:

268-mumnp-2003-abstract(13-12-2004).doc

268-mumnp-2003-abstract(13-12-2004).pdf

268-mumnp-2003-claim(granted)-(13-12-2004).doc

268-mumnp-2003-claim(granted)-(13-12-2004).pdf

268-mumnp-2003-correspondence(13-12-2004).pdf

268-mumnp-2003-correspondence(ipo)-(09-12-2003).pdf

268-mumnp-2003-drawing(13-12-2004).pdf

268-mumnp-2003-form 1(03-03-2003).pdf

268-mumnp-2003-form 1(23-04-2003).pdf

268-mumnp-2003-form 19(23-06-2003).pdf

268-mumnp-2003-form 1a(29-10-2004).pdf

268-mumnp-2003-form 2(granted)-(13-12-2004).doc

268-mumnp-2003-form 2(granted)-(13-12-2004).pdf

268-mumnp-2003-form 26(28-02-2003).pdf

268-mumnp-2003-form 3(23-04-2003).pdf

268-mumnp-2003-form 5(23-04-2003).pdf

268-mumnp-2003-form-pct-isa-210(13-12-2004).pdf

abstract1.jpg