TWI407307B - Identification tag and radio frequency identification system - Google Patents

Abstract

Disclosed is a radio frequency identification system, including an identification tag and a reader; where the identification tag includes a receiver and a processor; the receiver receives original data; the processor includes a memory unit, a partition unit and an accessing unit; the memory unit includes multiple data memory areas and message memory areas, and each data memory area includes multiple memory positions; the partition unit divides the original data into plural sub-data; the accessing unit stores the respective sub-data into different memory positions of the memory unit according to a predetermined manner, and the actual coordinate and sequence of each sub-data of the original data are stored, as a corresponding code, into the message memory areas, the accessing unit further forms the sub-data included in the data memory areas into data to be restored; the restoring device of the reader restores the data to be restored to obtain the original data according to the corresponding code.

Description

Identification tag and RFID system

The invention relates to an identification tag and a radio frequency identification system, in particular to an identification tag and a radio frequency identification system for configuring internal data of a memory unit in a predetermined manner.

Compared with traditional bar codes, radio frequency identification (RFID) systems have the advantages of repeatable reading and writing, non-contact, rich data recording, environmental resistance, and the ability to simultaneously read a plurality of identification tags in the transmission range. RFID has become an important tool for commodity tracking and information feedback in the logistics supply chain. However, since identification tags use radio to transmit data and are easily intercepted by arbitrary RFID readers, some research on RFID security mechanisms has been Propose to protect the security of the information in the identification tag.

Most of the current identification tags use different coding methods to prevent data leakage when transmitting data. However, it is easy to be cracked because only a simple logic gate is used to form a hash operation, which makes it impossible to effectively protect the data in the identification tag. Sex.

Accordingly, it is an object of the present invention to provide an RFID system that avoids the above-described deficiencies and increases the degree of security.

The RFID system includes an identification tag and a reading device; the identification tag includes a receiver, a processor and a transmitter; the receiver receives an original data; the processor includes a memory unit and a dividing unit And an access unit; the memory unit has a plurality of data memory areas and a a message memory area, wherein each data memory area has a plurality of memory locations; the dividing unit divides the original data sent by the receiver into a plurality of sub-data; the access unit separates the sub-data according to a predetermined manner Depositing in a different memory location of the data memory area of the memory unit, and storing the actual data of each of the original data in the data memory area and the order of the child data in the original data in a corresponding code In the message memory area, the access unit further forms the sub-data contained in the data memory area into a data to be restored; the transmitter sends the data to be restored and the corresponding code of each sub-data.

The reading device includes a receiver and a restorer; the receiver receives the to-be-restored data and a corresponding code of each sub-data; the restorer obtains the actual coordinates and order of the sub-data according to the corresponding codes, And according to this, the data to be restored is restored to obtain the original data after the reply.

The predetermined mode is one of an original interval, a specialization, a dispersion, a hybrid, a jump, a jump, or a special jump; the original interval is The sub-data stored in the adjacent memory location in a data memory area is a continuous sub-data, and is stored in the next adjacent data memory area when the data memory area is full; the specialization mode dynamically adjusts the setting. The number of empty memory locations between two consecutive sub-data is the degree of aggregation of the disperse data; the inter-distribution formula is such that the number of memory areas used for storing sub-data is the same as the number of sub-data of the original data, so that each data Only one sub-data of the original data is stored in the memory area, and the sub-data of each memory area can be stored in the The memory location has no order relationship between the sub-data stored in the adjacent memory locations; the inter-jump mode is a memory area in which the sub-data of the original data is stored, and has no adjacent relationship; The memory area of the sub-data of the original data does not have an adjacent relationship and the sub-data stored in the adjacent memory position does not have an order relationship; the special jump type is any memory in which each sub-data is stored in a memory area having no adjacent relationship. position.

Another object of the present invention is to provide an identification tag that avoids the lack of knowledge and increases the degree of security.

The identification tag includes a receiver and a processor; the receiver receives an original data; the processor includes a memory unit, a dividing unit, and an access unit; the memory unit has a plurality of data memory areas and a message a memory area, wherein each data memory area has a plurality of memory locations; the dividing unit divides the original data sent by the receiver into a plurality of sub-data; the access unit stores the sub-data separately according to a predetermined manner In a different memory location of the data memory area of the memory unit, and storing the actual data of each of the original data in the data memory area and the sub-data in the order of the original data in a corresponding code in the message Memory area.

The predetermined manner is one of an original interval, a specialization, a dispersion, a hybrid, a jump, a jump, or a special jump; The original data is a continuous sub-data stored in adjacent memory locations in each data memory area, and is stored in the next adjacent data memory area when a data memory area is full; the specialization Inter-mode dynamically adjusts the number of empty memory locations set between two consecutive sub-data to disperse the degree of aggregation of sub-data; the inter-distribution formula is the number of memory areas used to store sub-data and the number of sub-data possessed by the original data. Similarly, each data memory area only stores a sub-data of the original data, and the sub-data of each memory area can be stored in any memory location; the mixed type has no order between the sub-data stored in adjacent memory locations. The relationship between the jumps is that the memory area containing the child data of the original data has no adjacent relationship; the jump type is the sub-data of the memory area in which the original data has no adjacent relationship and is stored in the adjacent memory position. There is no order relationship between the two; the special jump is to store each sub-data in any memory location of the memory area without adjacent relationship.

The above and other technical contents, features and advantages of the present invention will be apparent from the following detailed description of the preferred embodiments.

As shown in FIG. 1, a preferred embodiment of the radio frequency identification (RFID) system of the present invention includes an identification tag T0 and a reading device R0.

The identification tag T0 includes a receiver T5, a transmitter T6 and a processor T1, and the processor T1 includes a dividing unit T3, an access unit T4 and a memory unit T2, as shown in FIG. The unit T2 includes a plurality of data memory areas Md and a message memory area M1, and each of the data memory areas Md includes a plurality of (for example, four) memory locations. The coupling relationship between the components is as follows: Referring back to FIG. 1, the dividing unit T3 is coupled to the receiver T5 and the access unit T4, the access unit T4 and the transmitter T6, the receiver T5, and the The memory unit T2 is coupled.

The reading device R0 includes a receiver R8, a transmitter R9, a reducer R1 and a signal generator R7, and the restorer R1 includes a temporary storage unit R4, an identification unit R5, a reduction unit R3, and a Reverse the data table R6 and a storage unit R2. The coupling relationship between the components is as follows: the receiver R8 is coupled to the temporary storage unit R4 and the identification unit R5, and the reduction unit R5 is coupled to the temporary storage unit R4, the identification unit R5 and the storage unit R2, respectively. The identification unit R5 is coupled to the inverse solution data table R6 and the transmitter R9 is coupled to the storage unit R4 and the signal generator R7, respectively.

Loading mode

Referring to FIG. 3, the identification tag T0 can perform a loading mode, and the detailed process includes the following steps:

Step 1: The receiver T5 of the identification tag T0 receives an original data sent from the reading device R0 and sends the original data to the dividing unit T3.

Step 2: The dividing unit T3 divides the original data into a plurality of sub-data, and sends the sub-data to the access unit T4.

Step 3: The access unit T4 compares the sub-data according to a predetermined manner They are respectively stored in the memory location of the data memory area of the memory unit T2, and each memory location stores at most one sub-data. And the predetermined manner may be an original interval, a specialization, a dispersion, a hybrid, a jump, a jump, or a special jump, but not limited thereto, and a little It will be explained in detail for each method. In this step, the access unit further stores the actual coordinates and order of each sub-data of the original data in the message memory area M1 with a corresponding code, where the coordinates are which data memory area each sub-data belongs to. Which memory location, and the order of the sub-data means that the sub-data is the first sub-data of the original data. It should be noted that the coordinates and order corresponding to each corresponding code are also pre-recorded in the inverse solution data table R6 of the reading device R0.

Step 4: The access unit T4 analyzes the data memory area of the child data in which at least one original data is stored. If there is an empty memory location in the data memory area, the child data irrelevant to the original data is randomly generated, and the generated data is generated. The subdata is stored in an empty memory location. In the example shown in FIG. 5, 16 sub-data needs to be generated to be stored in the memory location of the data memory area 0-7, and in the example of FIG. 4, random sub-data is not generated.

Introduction to the reservation method

As shown in FIG. 4, the original interval is such that the sub-data stored in the adjacent memory locations in each data memory area is a continuous sub-data, and is stored in the next adjacent one when the data memory area is full. Data memory area. Therefore, when this method is adopted, it is not necessary to generate random sub-data in step 4.

As shown in Figure 5, the difference between the specialization and the original is that the number of data memory areas is doubled to disperse the data of the sub-data, that is, It is said that according to the number of all memory locations, the number of empty memory locations set between two consecutive sub-data can be dynamically adjusted, and these empty memory locations will store random sub-data in step 4, as shown in the example of FIG. The number of empty memory locations between the sub-data 1, 2 can be changed to 0 or greater than or equal to 2, that is, if the x-coordinate is represented by the memory position, and the memory area represents the y-coordinate, the sub- The original coordinates of the data 1 and 2 are (3, 7), (1, 7), and can be changed to (3, 7), (2, 7), or (3, 7), (0, 7).

As shown in FIG. 6, the difference between the inter-scattering method and the original inter-type is that the number of useful data memory areas is the same as the number of sub-data items in the original data, so that only one original is stored in each data memory area. The sub-data of the data can increase the degree of dispersion of the sub-data, and the sub-data of each data storage area can be stored in any memory location, and the remaining empty memory locations will store random sub-data in step 4. For example, sub-data 1 can be stored in any of the four memory locations (3, 15) or (2, 15) or (1, 15) or (0, 15).

As shown in FIG. 7, the hybrid is similar to the original, except that there is no order relationship between the sub-data stored in adjacent memory locations.

As shown in Fig. 8, the jump mode is similar to the original mode. The difference is that the data memory area of the sub-data of the original data is discontinuous, that is, there is no adjacent relationship, and there is data stored in the sub-data. A blank memory area between the memory areas will store random sub-data in step 4. Therefore, the useful data memory area shown in Fig. 8 may be the data memory area 30, 25, 10, 0, and the blank memory areas 1~9, 11~24, 26~29 are filled with random sub-data respectively.

As shown in Figure 9, the jump mix is similar to the jump mode, different places Therefore, there is no order relationship between sub-data stored in adjacent memory locations.

As shown in FIG. 10, the special jump mode is to store each sub-data in any memory location of the data memory area having no adjacent relationship, and the remaining empty memory between the first data memory area and the tail data memory area. Location, will store random sub-data in step 4. For example, the blank memory locations of the data memory areas 1, 4, 11, 15, 20, 23, 42, 50 and the blank memory areas 2~3, 5~10, 12~14, 16~19, 21~22, 24~ All memory locations between 41 and 43~49 are stored in random sub-data.

Read mode

Referring to FIG. 11, the reading device R0 can perform a reading mode to read the identification tag. The detailed process includes the following steps:

Step 5: The signal generator R7 of the reading device R0 sends a pre-read signal and transmits it to an identification tag T0 through the transmitter R9 of the reading device R0.

Step 6: The access unit T4 of the identification tag T0 receives the pre-read signal through the receiver T5, and then accesses the memory unit T2 to read the corresponding code in the message memory area M1, and then transmits the corresponding code through the transmitter T6. The corresponding codes are transmitted to the reading device R0.

Step 7: The receiver R8 of the reading device R0 receives the corresponding codes transmitted by the identification tag T0 in step 6, and sends them to the identification unit R5.

Step 8: The identification unit R5 obtains a recognition result by finding the coordinates and order of each sub-data from the inverse solution data table R6 according to the corresponding codes. The identification result is notified to the restoration unit R3 and the signal generator R7 sends a read signal to the identification tag T0.

Step 9: The access unit T4 of the identification tag T0 receives the read signal through the receiver T5, and then sequentially from the first memory location of the first memory area to the last memory location of the tail memory area according to the coordinates. After the data is read, a data to be restored is formed, and the data to be restored is sent out through the transmitter T6.

As shown in FIG. 5, the first memory area is the memory area 0, and the tail memory area is the memory area 7, so the data to be restored includes the related sub-data 16~1 of the memory areas 0~7. Random sub-data, and if it is shown in Figure 4 and Figure 7, the data to be restored does not include random sub-data.

Step 10: The receiver R8 of the reading device R0 receives the data to be restored transmitted by the identification tag T0 in step 10, and sends the data to be restored to a temporary storage unit R4. The temporary storage unit R4 includes a plurality of temporary storage memories. Each memory area has a plurality of memory locations. In this embodiment, each memory area has four memory locations, that is, the data temporarily stored in the temporary storage unit R4 is arranged in the same manner as the data in the memory unit T2. Arrangement.

Step 11: The restoration unit R3 restores the data to be restored temporarily stored in the temporary storage unit R4 to the original data according to the identification result, and includes the following sub-steps as shown in FIG. 12: Step 111: The restoration unit R3 displays according to the identification result. The order and coordinates of each sub-data are selected from the temporary storage unit R4 for each sub-data belonging to the original data.

In this example, the special jump of Figure 10 is taken as an example to illustrate that the restoration unit R3 is first The memory location 0 of the temporary memory area 20 picks up the sub-data 16, and then the sub-data 15 is picked up by the memory location 0 of the temporary memory area 42, and so on, and finally the sub-data is picked up by the memory location 0 of the temporary memory area 50. 1.

Step 112: The restoration unit R3 arranges each of the sub-data belonging to the original data in step 111 into a series of original data.

Step 12: The restoration unit R3 sequentially stores the original data of the step 11 into the storage unit R2, as shown in FIG.

It should be noted that in this embodiment, the corresponding code must be based on the inverse solution data table R6 of the reading device R0 to solve the actual corresponding coordinates and order, but is not limited to this manner. In another embodiment, the difference is The reading device R0 does not use the inverse solution data table R6, but the access unit T4 of the identification tag T0 performs a conversion equation, and converts the actual coordinates and the sequence into a corresponding code according to the conversion equation, and the reading device R0 is restored. The identification unit R5 of the device R1 performs an inverse conversion equation to convert the corresponding code back to the actual coordinates and order, wherein the coefficients of the inverse conversion equation are equivalent to the inverse matrix operation of the coefficients of the conversion equation.

In summary, the preferred embodiment of the present invention divides the important data according to the predetermined manner described above, and then rearranges the information stored in the memory unit to hide the data, so as to prevent the data from being easily viewed and difficult to be cracked. To achieve the purpose of protecting the privacy of individuals.

The above is only the preferred embodiment of the present invention, and the scope of the invention is not limited thereto, that is, the simple equivalent changes and modifications made by the scope of the invention and the description of the invention are All remain within the scope of the invention patent.

1‧‧‧Steps to receive the original data

2‧‧‧Steps to split into sub-data

3‧‧‧Steps for access methods

4‧‧‧Steps for filling in random sub-data

5‧‧‧Steps for transmitting pre-read signals

6‧‧‧Steps for returning the corresponding code

7‧‧‧Steps for identifying the corresponding code

8‧‧‧Steps to read the signal

9‧‧‧Steps for transmitting information to be restored

10‧‧‧ Arranged in the temporary deposit Meta step

11‧‧‧Restoring the data to be restored

12‧‧‧Save in storage unit A step of

111‧‧‧Steps for picking out sub-data

112‧‧‧Steps in arranging raw materials

R0‧‧‧ reading device

R1‧‧‧ Restorer

R2‧‧‧ storage unit

R3‧‧‧Restore unit

R4‧‧‧ temporary storage unit

R5‧‧‧ identification unit

R6‧‧‧Reverse Information Sheet

R7‧‧‧Signal Generator

R8‧‧‧ Receiver

R9‧‧‧transmitter

T0‧‧‧ Identification Label

T1‧‧‧ processor

T2‧‧‧ memory unit

T3‧‧‧ split unit

T4‧‧‧ access unit

T5‧‧‧ Receiver

T6‧‧‧transmitter

M1‧‧‧ message memory area

Md‧‧‧ Data Memory Area

1 is a block diagram showing a preferred embodiment of the radio frequency identification system of the present invention; and FIG. 2 is a block diagram showing the memory unit.

3 is a flow chart showing the steps of the download mode of the present invention; FIG. 4 is a schematic view showing the original mode; FIG. 5 is a schematic view showing the specialization mode; FIG. 6 is a schematic view showing the inter-dispersion mode; Figure 7 is a schematic view showing a hybrid type; Figure 8 is a schematic view showing a jump mode; Figure 9 is a schematic view showing a jump-mix type; Figure 10 is a schematic view showing a special jump type; Figure 11 is a flow chart, The steps of reading mode are illustrated; FIG. 12 is a flow chart illustrating the steps of line detection; and FIG. 13 is a schematic diagram illustrating the arrangement of storage in the storage unit.

R0‧‧‧ reading device

R1‧‧‧ Restorer

R2‧‧‧ storage unit

R3‧‧‧Restore unit

R4‧‧‧ temporary storage unit

R5‧‧‧ identification unit

R6‧‧‧Reverse Information Sheet

R7‧‧‧Signal Generator

R8‧‧‧ Receiver

R9‧‧‧transmitter

T0‧‧‧ Identification Label

T1‧‧‧ processor

T2‧‧‧ memory unit

T3‧‧‧ split unit

T4‧‧‧ access unit

T5‧‧‧ Receiver

T6‧‧‧transmitter

Claims (6)

An RFID system includes an identification tag and a reading device; the identification tag includes a receiver, a processor and a transmitter; the receiver receives an original data; the processor includes a memory unit and a dividing unit And an access unit; the memory unit has a plurality of data memory areas and a message memory area, and each data memory area has a plurality of memory locations; the dividing unit divides the original data sent via the receiver into a plurality of sub-data; the access unit stores the sub-data in different memory locations of the data storage area of the memory unit according to a predetermined manner, and each sub-data of the original data is actually in the data storage area The coordinates and the sub-data are stored in the message memory area in a sequence corresponding to the original data, and the access unit further forms the sub-data contained in the data memory area into a data to be restored; the transmitter, the The corresponding data of the to-be-restored data and each sub-data is sent; the reading device comprises: a receiver, receiving the data to be restored and the corresponding code of each sub-data And a reducer, to obtain a code based on the corresponding plurality of actual coordinate and sequence of such sub data, and accordingly to be reduced to restore the original data to obtain the data after the reply; The predetermined mode is one of an original interval, a specialization, a dispersion, a hybrid, a jump, a jump, or a special jump; the original interval is The sub-data stored in the adjacent memory location in a data memory area is a continuous sub-data, and is stored in the next adjacent data memory area when the data memory area is full; the specialization mode dynamically adjusts the setting. The number of empty memory locations between two consecutive sub-data is the degree of aggregation of the disperse data; the inter-distribution formula is such that the number of memory areas used for storing sub-data is the same as the number of sub-data of the original data, so that each data The memory area only stores a sub-data of the original data, and the sub-data of each memory area can be stored in any memory position; the mixed type has no order relationship between the sub-data stored in the adjacent memory position; The memory area in which the sub-data of the original data is stored has no adjacent relationship; the jump-mixed memory area in which the sub-data of the original data is stored has no adjacent relationship and is not stored between the sub-data stored in the adjacent memory position. Sequence relationship; skip this particular formula to be stored in each sub-data does not have any memory location of the adjacent memory cell relation. According to the radio frequency identification system of claim 1, wherein the access unit further analyzes a data memory area in which at least one piece of original data is stored, and if there is an empty memory location in the data memory area, The machine generates sub-data that is not related to the original material, and stores the generated sub-data into an empty memory location. The radio frequency identification system according to claim 1, wherein the restorer has an inverse solution data table and an identification unit, wherein the inverse solution data table records an actual coordinate and an order corresponding to each corresponding code, and the The identification unit finds the coordinates and order of each sub-data from the inverse solution data table according to the corresponding codes. The radio frequency identification system according to claim 1, wherein the access unit performs a conversion equation to convert the actual coordinates and the sequence into the corresponding code, and the restorer performs an inverse conversion equation to convert the corresponding code The actual coordinates and order are returned, wherein the coefficient of the inverse conversion equation is equivalent to the inverse matrix operation of the coefficients of the conversion equation. An identification tag comprising: a receiver for receiving an original data; and a processor comprising a memory unit, a dividing unit, and an access unit; the memory unit having a plurality of data memory areas and a message a memory area, wherein each data memory area has a plurality of memory locations; the dividing unit divides the original data sent by the receiver into a plurality of sub-data; the access unit stores the sub-data separately according to a predetermined manner In the different memory locations of the data memory area of the memory unit, and the actual coordinates of the original data in the data memory area and the order of the child data in the original data are stored in the message memory by a corresponding code. Area The predetermined mode is one of a primitive interval, a specialization interval, a dispersion interval, a hybrid, a jump, a jump, or a special jump; the original interval is The sub-data stored in adjacent memory locations in each data memory area is a continuous sub-data, and is stored in the next adjacent data memory area when a data memory area is full; the specialization mode is dynamically adjusted The number of empty memory locations set between two consecutive sub-data is the degree of aggregation of the scattered sub-data; the inter-distribution formula is such that the number of memory areas used for storing sub-data is the same as the number of sub-data of the original data, so that each The data memory area only stores a sub-data of the original data, and the sub-data of each memory area can be stored in any memory location; the mixed type has no order relationship between the sub-data stored in the adjacent memory locations; The memory area in which the sub-data of the original data is stored has no adjacent relationship; the jump mixed is that the memory area in which the sub-data of the original data is stored has no adjacent relationship and is not stored between the sub-data of the adjacent memory location. Sequential relation; skip this particular formula to be stored in each sub-data does not have any memory location of the adjacent memory cell relation. According to the identification tag described in claim 5, wherein the access unit further analyzes the data of the sub-data of at least one original data. The memory area, if there is an empty memory location in the data memory area, randomly generates sub-data that is not related to the original data, and stores the generated sub-data into an empty memory location.