Mobile radio frequency identification method and device based on bitwise synthesis operation

Abstract

The present invention discloses a mobile radio frequency identification method and device for bitwise synthesis operation, the method comprising: a reader sends an authentication request command to a tag; the tag calculates a tag message value; the reader verifies the tag and calculates a reader message value; the server verifies the tag and the reader according to the tag message value and the reader message value, and updates a shared key; the reader verifies the server according to the server message value, calculates a second reader message value and updates a shared key; the tag verifies the reader and the server according to the server message value and the second reader message value, and updates a shared key. The device comprises a memory and a processor for executing the mobile radio frequency identification method for bitwise synthesis operation. By using the present invention, the problem of security defects in two-way authentication between a server, a reader and a tag in a mobile RFID system can be solved. The present invention can be widely used in the field of radio frequency identification technology.

Description

Technical Field

[0001] The present invention relates to the field of radio frequency identification technology, and in particular to a mobile radio frequency identification method and device based on bitwise synthesis operation. Background Art

[0002] Radio frequency identification technology is a technology that can read the data stored in a specific object without contacting the object. The most widely used application of this technology is the RFID system. A classic and traditional RFID system includes but is not limited to tags, servers, and readers. Tags have many advantages, such as small size, easy to carry, simple installation, low cost, long life, etc. Due to the above factors, radio frequency identification technology has been widely used in various fields, such as access control systems, campus card systems, bus card systems, etc.

[0003] In traditional RFID systems, readers and servers are generally placed in fixed locations, and their positions will not change almost throughout their service life, so that the two can exchange data in a more secure wired way, such as through coaxial cables or optical fibers. However, with the continuous development of society, the demand for mobile RFID is increasing, making it impossible for traditional RFID systems to meet people's more mobile RFID needs. For example, people want to be able to shop online and make online payments while staying at home. This demand does not meet the requirements of traditional RFID systems with fixed readers and servers. The emergence of mobile RFID systems has perfectly solved this problem. At present, there are security defects in the two-way authentication between servers, readers and tags in mobile RFID systems. Summary of the invention

[0004] The purpose of the present invention is to provide a mobile radio frequency identification method and device based on bitwise synthesis operation, which can solve the problem of security defects in two-way authentication between a server, a reader and a tag in a mobile RFID system.

[0005] The first technical solution adopted by the present invention is: a mobile radio frequency identification method of bit-by-bit synthesis operation, comprising the following steps:

[0006] The reader sends an authentication request command to the tag;

[0007] The tag receives the authentication request instruction, calculates the tag message value, and transmits the tag message value to the reader;

[0008] The reader verifies the tag according to the tag message value. After verification, it calculates the reader message value and transmits the reader message value and tag message value to the server.

[0009] The server verifies the tag and reader based on the tag message value and the reader message value respectively. After verification, it calculates the server message value and updates the shared key, and transmits the server message value to the reader.

[0010] The reader verifies the server according to the server message value, calculates the second reader message value and updates the shared key after verification, and transmits the server message value and the second reader message value to the tag;

[0011] The tag verifies the reader and the server according to the server message value and the second reader message value respectively, and updates the shared key after the verification is passed.

[0012] Further, the tag receives the authentication request instruction, calculates the tag message value, and transmits the tag message value to the reader, which specifically includes:

[0013] The tag receives the authentication request instruction;

[0014] Generate a random number Tx;

[0015] Calculate tag message value T2=Bco(K,Tx,K&Tx), T3=Bco(K,TID,Tx);

[0016] Pass tag message values ​​T1, T2, T3 to the reader.

[0017] Further, the reader verifies the tag according to the tag message value, calculates the reader message value after verification, and transmits the reader message value and the tag message value to the server, which specifically includes:

[0018] The reader transforms the tag message value T1 to obtain According to the same calculation rules,

[0019] Compare T2` with T2, and if they are equal, the verification passes;

[0020] The reader generates a random number Rx and calculates the reader message value R2=Bco(Rx,RID,K), R3=Bco(T3,Rx,Tx);

[0021] The reader message values ​​R1, R2, R3 and the tag message value T1 are transmitted to the server.

[0022] Further, the server verifies the tag and the reader according to the tag message value and the reader message value respectively, calculates the server message value and updates the shared key after the verification, and transmits the server message value to the reader, which specifically includes:

[0023] Server to reader message value Deformation

[0024] According to the same calculation rules,

[0025] Compare R2` with R2, and if they are equal, the verification passes;

[0026] Tag message value Deformation According to the same calculation rules,

[0027] Combined with T3` and using the same calculation rules, we can get R3`=Bco(T3`,Rx`,Tx`);

[0028] Compare R3` with R3, and if they are equal, both the reader and the tag have passed the verification;

[0029] The server generates a random number DBx and calculates the server message value DB3=Bco(K,RID,DBx), DB4=Bco(K,DBx,TID), and then the shared key is updated;

[0030] After the shared key is updated, the server message values ​​DB1, DB2, DB3, and DB4 are sent to the reader.

[0031] Further, the update method of the shared key update includes:

[0032] If K new Verification passed, update shared key

[0033] If K old Verification passed, update shared key

[0034] K new Indicates the current shared key between the server, tag and reader, K old Indicates the shared key between the server, tag and reader in the previous round.

[0035] Further, the reader verifies the server according to the server message value, calculates the second reader message value and updates the shared key after the verification, and transmits the server message value and the second reader message value to the tag. This step specifically includes:

[0036] Reader-writer message value to server Deformation

[0037] According to the same calculation rules,

[0038] Compare DB3` with DB3 and judge that they are equal, and the server passes the verification;

[0039] The reader calculates the second reader message value R4 = Bco (DB4, Rx, Tx & DBx) and updates the shared key

[0040] The shared key update is completed, and finally the server message value DB2 and the second reader message value R4 are sent to the tag.

[0041] Furthermore, the tag verifies the reader and the server respectively according to the server message value and the second reader message value, and updates the shared key after the verification is passed, which specifically includes:

[0042] The tag checks the value of Count corresponding to the message value R4 of the second reader;

[0043] If the value is 0, the server and reader are verified.

[0044] Tag to server message value Deformation

[0045] According to the same calculation rules,

[0046] Combined with the calculated DB4`, the same operation rules are used to calculate R4`=Bco(DB4`,Rx`,Tx&DBx`);

[0047] Compare the calculated R4` with the received R4, and if they are equal, the server and reader are authenticated; the tag starts to update the shared key.

[0048] The second technical solution adopted by the present invention is: a mobile radio frequency identification device based on bitwise synthesis operation, comprising:

[0049] at least one processor;

[0050] at least one memory for storing at least one program;

[0051] When the at least one program is executed by the at least one processor, the at least one processor implements the mobile radio frequency identification method based on bitwise synthesis operation as described above.

[0052] The beneficial effects of the method and device of the present invention are as follows: the method proposed in the present invention 1) can be used in a mobile RFID system and can also be used in a traditional RFID system, thereby expanding the scope of use; 2) an encryption algorithm independently developed and designed is used to encrypt information, namely, a bitwise synthesis operation; 3) the bitwise synthesis operation is implemented based on the bitwise operation, and the encryption algorithm can make the proposed method reach an ultra-lightweight level in terms of computational complexity; 4) the bitwise synthesis operation cleverly utilizes the Hamming weights carried by the encryption parameters themselves during the design process, which can reduce the storage amount and increase the difficulty of cracking without adding new parameters. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 It is a flow chart of the steps of a mobile radio frequency identification method based on bitwise synthesis operation of the present invention;

[0054] Figure 2 It is a structural block diagram of a three-party authentication protocol according to a specific embodiment of the present invention;

[0055] Figure 3 It is a schematic diagram of the bitwise synthesis operation flow of a specific embodiment of the present invention. DETAILED DESCRIPTION

[0056] The present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. The step numbers in the following embodiments are only provided for the convenience of explanation and description, and the order between the steps is not limited in any way. The execution order of each step in the embodiment can be adaptively adjusted according to the understanding of those skilled in the art.

[0057] First, the meaning of each symbol in this agreement is given:

[0058] DB represents the backend server, T represents the tag, R represents the reader, and K represents the shared key among DB, T, and R. new Indicates the current shared key between DB, T, and R, K old Indicates the last round shared key between DB, T, and R. TID indicates the unique identifier of the tag. RID indicates the unique identifier of the reader. DBx indicates the random number generated by the background server. Tx indicates the random number generated by the tag. Rx indicates the random number generated by the reader. DB1 , DB2 , DB3 , DB4 represents the message calculated by the background server, T1, T2, T3 represent the message calculated by the tag, R1, R2, R3, R4 represent the message calculated by the reader, represents the XOR operation, & represents an AND operation, Bco(X,Y,Z) represents a bitwise synthesis operation, Query represents a request instruction, and Count represents a counter at one end of the tag.

[0059] Implementation steps of bitwise composition operation (Bco(X,Y,Z)).

[0060] (1) The bitwise synthesis operation is represented by the symbol Bco(X,Y,Z), where X,Y,Z,Q in the above symbol are binary sequences of length L bits.

[0061] (2) H(X) represents the Hamming weight of binary sequence X; H(Y) represents the Hamming weight of binary sequence Y; H(Z) represents the Hamming weight of binary sequence Z.

[0062] (3) H(X), H(Y), and H(Z) compare the sizes and perform bitwise synthesis operations in different ways and orders based on the comparison results.

[0063] Assuming that the comparison result is H(Y)≥H(X)≥H(Z), bitwise synthesis is performed as follows:

[0064] From left to right, take the value at the (3i-2)th bit (where i = 1, 2, 3, ...) of the binary sequence Y, and place it at the (3i-2)th bit (where i = 1, 2, 3, ...) of the binary sequence Q;

[0065] At the same time, take the value of the (3i-1)th bit (where i = 1, 2, 3, ...) of the binary sequence X from left to right, and place it in the (3i-1)th bit (where i = 1, 2, 3, ...) of the binary sequence Q in turn;

[0066] At the same time, take the value of the 3ith bit (where i = 1, 2, 3, ...) of the binary sequence Z from left to right, and place it in the 3ith bit (where i = 1) of the binary sequence Q. , 2 , 3,…) on;

[0067] At this point, the bit-by-bit synthesis is completed, and a binary sequence Q with a length of L bits is constructed.

[0068] The following example will illustrate the implementation of the bitwise synthesis operation more vividly. Take L = 12, X = 101101011100, Y = 010111011110, Z = 000101001011, then we can get H(X) = 7, H(Y) = 8, H(Z) = 5. Comparing the sizes of the three, we can get H(Y) ≥ H(X) ≥ H(Z). According to the above definition of bitwise synthesis operation, we can get: take the (1, 4, 7, 10)th bit of the binary sequence Y, take the (2, 5, 8, 11)th bit of the binary sequence X, and take the (3, 6, 9, 12)th bit of the binary sequence Z and put them in the corresponding positions, finally forming the binary sequence Q = Bco(X, Y, Z) = 000101011101. The specific implementation process is as follows: Figure 3 shown.

[0069] In the mobile RFID system, information is transmitted between the server, reader, and tag through wireless transmission. It is generally believed that wireless plain text transmission is unsafe. Figure 1 and Figure 2 The present invention provides a mobile radio frequency identification method based on bitwise synthesis operation, the method comprising the following steps:

[0070] S1. The reader sends an authentication request command Query to the tag;

[0071] S2. The tag generates a random number Tx and calculates the message T2=Bco(K,Tx,K&Tx), T3=Bco(K,TID,Tx), and send messages T1, T2, and T3 to the reader at the same time.

[0072] The S3 reader verifies the authenticity of the tag through T1 and T2.

[0073] Specifically, the message Deformation According to the same calculation rules, The calculated T2 is compared with the received T2. If the two are not equal, the tag fails the verification; if the two are equal, the tag passes the verification and continues with the subsequent operation.

[0074] The reader then generates a random number Rx and calculates the message R2=Bco(Rx,RID,K), R3=Bco(T3,Rx,Tx), and finally send the messages R1,R2,R3,T1 to the server.

[0075] The S4 server first authenticates the reader, and then authenticates the reader and tag at the same time.

[0076] The server authenticates the reader as follows.

[0077] Server to Message Deformation Then, according to the same calculation rules, we can get Compare the calculated R2` with the received R2. If the two are not equal, the reader fails the verification; if the two are equal, the reader passes the verification and continues the subsequent operation.

[0078] The server authenticates both the reader and the tag as follows.

[0079] About the message Deformation According to the same calculation rules, Combined with the calculated T3, the same operation rules are used to calculate R3`=Bco(T3`,Rx`,Tx`). Compare the calculated R3` with the received R3. If the two are not equal, the reader and tag fail to pass the verification; if the two are equal, the reader and tag pass the verification and continue with the subsequent operation.

[0080] The server then generates a random number DBx and calculates the message DB3=Bco(K,RID,DBx), DB4=Bco(K,DBx,TID), then the shared key is updated. After the shared key update is completed, the messages DB1, DB2, DB3, DB4 are sent to the reader.

[0081] There are two ways to update the shared key:

[0082] If K new Verification passed, update shared key

[0083] If K old Verification passed, update shared key

[0084] S5. The reader verifies the server, mainly through messages DB1 and DB3. The specific verification is as follows.

[0085] Reader-writer message Deformation Then, according to the same calculation rules, we can get The calculated DB3` is compared with the received DB3. If the two are not equal, the server fails the verification; if the two are equal, the server passes the verification and continues the subsequent operation.

[0086] The reader calculates the message R4 = Bco (DB4, Rx, Tx & DBx), and then the reader starts to update the shared key After the shared key is updated, the message DB2, R4 is sent to the tag.

[0087] S6. The tag first checks the value of Count corresponding to R4 received. If it is not 0, no operation is performed; if it is 0, subsequent operations are performed.

[0088] The tag starts to authenticate the reader and the server. The specific authentication method is as follows.

[0089] Tags for messages Deformation Then, according to the same calculation rules, we can get Combined with the calculated DB4`, the same operation rules are used to calculate R4`=Bco(DB4`,Rx`,Tx&DBx`). Compare the calculated R4` with the received R4. If the two are not equal, the server and the reader fail to pass the verification; if the two are equal, the server and the reader pass the verification and continue with the subsequent operation.

[0090] The tag starts updating the shared key Once the shared key is updated, the authentication between the tag, reader and server is completed.

[0091] A mobile radio frequency identification device with bitwise synthesis operation:

[0092] at least one processor;

[0093] at least one memory for storing at least one program;

[0094] When the at least one program is executed by the at least one processor, the at least one processor implements the mobile radio frequency identification method of bitwise synthesis operation as described above.

[0095] The contents of the above method embodiments are all applicable to the present device embodiments. The functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0096] A storage medium stores processor-executable instructions, wherein the processor-executable instructions are used to implement the above-mentioned mobile radio frequency identification method of bit-by-bit synthesis operation when executed by the processor.

[0097] The contents of the above method embodiments are all applicable to the present storage medium embodiments. The functions specifically implemented by the present storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0098] The above is a specific description of the preferred implementation of the present invention, but the invention is not limited to the embodiments. Those skilled in the art may make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of this application.

Claims

1. Mobile radio frequency identification method based on bitwise synthesis operation, It is characterized in that The following steps are involved: The reader sends an authentication request command to the tag; The tag receives the authentication request instruction, calculates the tag message value, and transmits the tag message value to the reader; The reader verifies the tag according to the tag message value. After verification, it calculates the reader message value and transmits the reader message value and tag message value to the server. The server verifies the tag and reader based on the tag message value and the reader message value respectively. After verification, it calculates the server message value and updates the shared key, and transmits the server message value to the reader. The reader verifies the server according to the server message value, calculates the second reader message value and updates the shared key after verification, and transmits the server message value and the second reader message value to the tag; The tag verifies the reader and the server according to the server message value and the second reader message value, and updates the shared key after the verification is passed; The tag receives the authentication request instruction, calculates the tag message value, and transmits the tag message value to the reader / writer. The step specifically includes: The tag receives the authentication request instruction; Generate a random number Tx; Calculate tag message value T2=Bco(K,Tx,K&Tx), T3=Bco(K,TID,Tx); K represents the shared key of the background server, tag and reader; TID represents the unique identifier of the tag; Bco(·) represents bitwise synthesis calculation; Transmit tag message values ​​T1, T2, and T3 to the reader; The reader verifies the tag according to the tag message value, calculates the reader message value after verification, and transmits the reader message value and the tag message value to the server. This step specifically includes: The reader transforms the tag message value T1 to obtain According to the same calculation rules, Compare T2′ with T2. If they are equal, the verification is successful. The reader generates a random number Rx and calculates the reader message value R2=Bco(Rx,RID,K), R3=Bco(T3,Rx,Tx); RID represents the unique identifier of the reader; Send the reader message values ​​R1, R2, R3 and the tag message value T1 to the server; The server verifies the tag and the reader according to the tag message value and the reader message value respectively, calculates the server message value and updates the shared key after the verification, and transmits the server message value to the reader. The step specifically includes: Server to reader message value Deformation According to the same calculation rules, Compare R2′ with R2. If they are equal, the verification is successful. Tag message value Deformation According to the same calculation rules, Combined with T3′ and using the same calculation rules, we can get R3′=Bco(T3′,Rx′,Tx′); Compare R3′ with R3. If they are equal, both the reader and the tag have passed the verification. The server generates a random number DBx and calculates the server message value DB3=Bco(K,RID,DBx), DB4=Bco(K,DBx,TID), and then the shared key is updated; After the shared key is updated, the server message values ​​DB1, DB2, DB3, and DB4 are sent to the reader.

2. According to claim 1, a mobile radio frequency identification method based on bitwise synthesis operation, It is characterized in that The updating method of the shared key update includes: If K new Verification passed, update shared key K old =K new , If K old Verification passed, update shared key K old =K old , K new Indicates the current shared key between the server, tag and reader, K old Indicates the shared key between the server, tag and reader in the previous round.

3. According to the mobile radio frequency identification method based on bitwise synthesis operation as claimed in claim 2, It is characterized in that The reader verifies the server according to the server message value, calculates the second reader message value and updates the shared key after the verification, and transmits the server message value and the second reader message value to the tag. This step specifically includes: Reader-writer message value to server Deformation According to the same calculation rules, Compare DB3′ with DB3 and judge that they are equal. The server passes the verification. The reader calculates the second reader message value R4 = Bco (DB4, Rx, Tx & DBx) and updates the shared key The shared key update is completed, and finally the server message value DB2 and the second reader message value R4 are sent to the tag.

4. According to claim 3, a mobile radio frequency identification method based on bitwise synthesis operation, It is characterized in that The tag verifies the reader and the server respectively according to the server message value and the second reader message value, and updates the shared key after the verification is passed. This step specifically includes: The tag checks the value of Count corresponding to the message value R4 of the second reader; If the value is 0, the server and reader are verified. Tag to server message value Deformation According to the same calculation rules, Combined with the calculated DB4′, the same operation rules are used to calculate R4′=Bco(DB4′,Rx′,Tx&DBx′); Compare the calculated R4′ with the received R4, and if they are equal, the server and reader are authenticated. The tag starts updating the shared key 5. A mobile radio frequency identification device based on bitwise synthesis operation, It is characterized in that include: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the mobile radio frequency identification method based on bitwise synthesis operation as described in any one of claims 1 to 4.

Images