An RFID tag feature code generation method and device based on a finite field traversal matrix
An RFID tag and traversal matrix technology, applied in computer security devices, record carriers used by machines, instruments, etc., can solve problems such as data security risks, loss of important information on commodities, and leakage
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment
[0056] Step 1. Define 9*9 F2 traversal matrix DI 0
[0057]
[0058] Step 2: Take the last 81 bits of the 96-bit RFID tag code to form a matrix T, and calculate the transpose matrix T of the matrix T at the same time -1 Respectively
[0059]
[0060]
[0061] Step 3. Calculate the feature code T’=T+DI 0
[0062]
[0063] Step 4: Take each element on the main diagonal of the feature code T' from the upper left to the lower right to form a matrix S 1 , in the same way, each element on the diagonal of T' times is sequentially taken from the bottom left to the top right to form a matrix S 2 ;
[0064] S1=(101001011) 2 =(331) 10 , S2=(010001101) 2 =(141) 10 ;
[0065] Step 5. Arbitrarily select the n-order traversal matrix Q of the matrix on the finite field 1 and Q 2 ;
[0066] In this example,
[0067]
[0068] Step 6. Calculate the ciphertext sequence C 1 , the formula is as follows: C 1 =(Q 1 ) S1 T'(Q 2 ) S2 ;
[0069] In this example, ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


