CN101217362B - RFID communication security mechanism established based on dynamic randomization DRNTRU public key encryption system - Google Patents

Abstract

The invention discloses an RFID communication safety mechanism which is established by a public key encrypting system on the base of dynamic randomization DRNTRU (Dynamic, Randomized Number Theory Research Unit). The RFID communication safety mechanism which is established by a public key encrypting system based on the dynamic randomization DRNTRU can not only effectively solve the safety problemof the RFID system. The method is novel, simple and easy to realize, does not need to fully search secret keys and TID (tag identifier) of, does not need secret key synchronization, only needs single-direction authentication and is suitable for the RFID system having limited resource and requiring high-speed responding.

Description

A kind of RFID communication security mechanism of setting up based on dynamic randomization DRNTRU public key encryp

Technical field

The invention belongs to communication technical field, be particularly suitable for the radio-frequency (RF) tag recognition technology.

Background technology

Extensive use along with RFID (radio frequency identification), the safety problem of rfid system also becomes increasingly conspicuous, the major Safety that rfid system exists has privacy concerns, flow analysis and trackability, individual privacy leakage problem, these problems have seriously hindered further developing of RFID, become one of the urgency of rfid system development key issue to be solved.Thereby, the numerous network security scholars' of industry concern and input have also been attracted, and various solutions and strategy proposed, as use hash function, symmetric key or the like, system needs the identification code TID and the key of server exhaustive search label in back-end data base, the part system more needs the key synchronization at server and label two ends, and the algorithm of keeping server and label two ends key synchronization extremely complexity be difficult to realize, thereby all need expend ample resources such as the time of implementation and the memory space of system, and the rfid system that is not suitable for requiring high-speed response only to have limited resources again uses.So far, industry still fail to propose a safety, efficient, practical, be fit to the solution of rfid system Communication Security Problem cheaply.The present invention has proposed dynamic randomization DRNTRU (Dynamic first in the rfid system security fields, RandomizedNumberTheoryResearchUnit) public key encryp, proposition is based on the NTRU public key encryp, randomization parameter is introduced this algorithm, make it become dynamic, randomized DRTRUN public-key cryptosystem, and apply it to rfid system.The rfid system communication security mechanism of using dynamic randomization DRNTRU public key encryp to set up has not only solved the safety problem of rfid system communication effectively, and have novelty, simple, be easy to realize, do not need the key exhaustive search, do not need key synchronization, be highly suitable for having the rfid system of limited resources.

Summary of the invention

The purpose of this invention is to provide a kind of RFID communication security mechanism of setting up based on dynamic randomization DRNTRU public key encryp, this scheme can satisfy the requirement of the security mechanism of the radio communication between the read write line (Reader) and label (Tag) in middle grade and high-grade radio-frequency (RF) identification (RFID) technology.

For reaching above-mentioned purpose, the present invention is achieved by taking following technical scheme:

A kind of RFID communication security mechanism of setting up based on dynamic randomization DRNTRU public key encryp when it is characterized in that rfid system is initial, uses dynamic randomization DRNTRU public key encryp to generate PKI h by server _KeyAnd private key (f _Key, F _p), and be unique identification code TID of each label distribution, server is stored in label and back-end data base simultaneously with identification code TID and the relevant information of posting the article of this label, with PKI h _KeyAnd private key (f _Key, F _p) being stored in label and back-end data base respectively, the communication authentication protocol step of rfid system is as follows:

(1) read write line (Reader) → label (Tag): read write line is gathered L from multinomial _mIn choose a random number R _r, and to label transmission authentication request Query, simultaneously with R _rSend to label;

(2) label (Tag) → read write line (Reader) → server (Server): label is received authentication request (Query, the R that read write line is sent _r) after, at first also from multinomial set L _mIn choose a random number R _tCalculate

Again from multinomial set L _ωIn choose a random number ω, utilize PKI h _KeyC is carried out cryptographic calculation Then with (PID, R _t) sending to read write line, read write line is again with (PID, R _t, R _r) be transmitted to server;

(3) server (Server): server is received (PID, R _t, R _r) after, at first utilize private key (f _Key, F _p), to the PID computing of decoding:

With

Obtain C, because

C is carried out R ₁=Z||C transmits the (R of coming to read write line again _t, R _r) carry out

Then both are carried out XOR:

If the result is 0, then authentication is passed through, and intercepts g (C, 0,63) again, can obtain identification code TID; Otherwise, authentification failure, refusal is accepted identification code TID and shut-down operation.

Dynamic randomization DRNTRU public key encryp of the present invention is based on the NTRU public key encryp, with randomization parameter R _r, R _tIntroduce the NTRU encryption system, concrete grammar is to original cryptographic algorithm The plaintext m processing of making amendment, it is carried out

Conversion can be with randomization parameter R _r, R _tIntroduce the NTRU encryption system, make the NTRU encryption system become dynamic randomization DRNTRU public key encryp.Order: ID, R _r, R _t∈ L _m, ω ∈ L _ω, parameter p=3 of selection NTRU, then L _m{ coefficient of m ∈ R:m is in [1,1] interval }, identification code TID is the binary number of 64bits, represents with ID, only takies [the ID of ID ₀, ID ₁..., ID ₆₃], remaining [ID ₆₄, ID ₆₅..., ID _N-1] be used to transmit random number R _r, R _t, definition: make v, u, w ∈ L _m, with v, u, the w vector representation, its length is N,

v＝[v ₀，v ₁，...，v ₆₃，v ₆₄，v ₆₅，...，v _N-1]，

u＝[u ₀，u ₁，...，u ₆₃，u ₆₄，u ₆₅，...，u _N-1]，

w＝[w ₀，w ₁，...，w ₆₃，w ₆₄，w ₆₅，...，w _N-1]，

|| connect computing: w=v||u=[v ₀, v ₁..., v ₆₃, u ₆₄, u ₆₅..., u _N-1],

G (w, i, j) intercepting computing: g (w, i, j)=[w _i, w _I+1..., w _j].

Characteristics of the present invention are:

1. dynamic randomization DRNTRU public key encryp has been proposed first.Because rfid system is followed the tracks of as anti-safety problem; anti-flow analysis; secret protections etc. have specific (special) requirements; existing NTRU public key encryp can't be realized the anti-tracking of rfid system; anti-flow analysis; the special requirement of security protections such as secret protection must make that the NTRU public key encryp has dynamically, the function of change at random.This programme is introduced this cryptographic algorithm based on the NTRU public key encryp with randomization parameter, it is become have a kind of new public key encryp---dynamic randomization DRNTRU public key encryp dynamic, the change at random function.The key that this encryption method not only has the NTRU public key encryp produces easily, encrypt, decipher rapidly, key is short and security performance is high, to characteristics such as the low occupying system resources of the performance requirement of bandwidth, processor, memory are few, and has again dynamically and the new function of change at random.

2. propose first to use dynamic randomization DRNTRU public key encryp to set up the security mechanism of rfid system, this dynamic randomization DRNTRU public key encryp is applied to rfid system, the rfid system communication security mechanism of Jian Liing thus, the special safety problem that can solve rfid system effectively and had.In addition, this programme has been realized the unilateral authentication of rfid system communication protocol, and compare unilateral authentication with two-way authentication simple more, quick, is more suitable for requiring the rfid system of high-speed response to use.Since this method only utilize plaintext m in the DRNTRU cryptographic algorithm just realized ID and In time, transmit, and reduced the transmission time, reduced bandwidth.Whole system is only used a pair of PKI and private key, need or not key synchronization at back-end data base exhaustive search key, has reduced complicated key storage and key management system, has saved a large amount of time and the spaces of system.Because only there is server just to have private key, can unties the cipher-text information of a label, thereby only need label is carried out unilateral authentication.Again because server can directly obtain encryption identification sign indicating number TID by authentication, deciphering, thus need be in back-end data base exhaustive search identification code TID, be easy in the label of the rfid system that requires only to have at a high speed, again limited resources, implement.

The invention has the beneficial effects as follows:

The rfid system communication security mechanism that the dynamic randomization DRNTRU public key encryp that adopts the present invention to propose is set up, whole system only needs a pair of PKI and private key, the encryption that all uses public-key of all labels, server all uses the private key deciphering, using the DRNTRU public key encryp all is that dynamic random changes to the ciphertext PID that ID (TID) encrypts each generation, thereby can resist attacks such as flow analysis and tracking effectively, again because each identification code TID difference, the ID that uses the DRNTRU PKI to encrypt in the communication of back transmits PID with the ciphertext that changes, so can guarantee each label, the pid information that each authentication is read is all inequality, so can realize maintaining secrecy of the information of transmitting, the opposing Denial of Service attack, Replay Attack, active attack etc. have satisfied the specific (special) requirements of rfid system communication security mechanism.

The rfid system communication security mechanism that the dynamic randomization DRNTRU public key encryp that adopts the present invention to propose is set up, rfid system can be solved effectively and maintaining secrecy of the information of transmitting can be realized, the opposing Denial of Service attack, Replay Attack, active attack, attacks such as opposing flow analysis and tracking, and do not need exhaustive search key and label TID, do not need key updating, key storage and management are simple, have novelty, simply be easy to realize, therefore, the present invention has response speed again when efficiently solving the rfid system Communication Security Problem fast, resource requirement is few, be easy to characteristics such as realization, be very suitable for being used to set up rfid system communication security mechanism.

The security performance that following table is listed existing security protocol and security protocol of the present invention compares.

The security performance of table 1 the whole bag of tricks relatively

Description of drawings

Fig. 1 is the communication authentication agreement schematic diagram of rfid system of the present invention.

Embodiment

One, sets up dynamic randomization DRNTRU public key encryp

The 1NTRU public key encryp

The hybrid system based on polynomial algebra and logarithm p and q reduction mould is used in the encryption of NTRU public key encryp, and the non-hybrid system based on probability theory is used in deciphering.The fail safe of NTRU is based on the interaction of multinomial, not isotype hybrid operation and based on a mathematics difficult problem of seeking utmost point short vector in the number theory from very large dimension lattice.Because this algorithm has only used simple mould to take advantage of and the mould inversion operation, thereby it has the key generation easily, encrypt, decipher rapidly, key is short and security performance is high, performance requirement to bandwidth, processor, memory hangs down characteristics such as occupying system resources is few, NTRU has caused great concern in field of cryptography, and has obtained developing rapidly with perfect, has obtained good effect in actual applications.

A NTRU public key encryp is based upon three numeric parameters, and (q) the highest ordered coefficients with four integral coefficients is the multinomial set L of N-1 for N, p _f, L _g, L _ω, L _mOn.P, q needn't be prime number, (p, q)=1, and q is much larger than p but require gcd.NTRU builds on Root of Integer Polynomial ring R=Y[X]/(X ^M-1) on, an elements A ∈ R can be expressed as a multinomial or a vector:

With

Come the multiplication on the representative ring R, this multiplication can be expressed as a circular convolution:

$C_k=\underset{i=0}{\overset{k}{\mathrm{\Σ}}}{A}_i{B}_{k-i}+\underset{i=k+1}{\overset{N-1}{\mathrm{\Σ}}}{A}_i{B}_{N+k-i}=\underset{i+j\≡k\left(\mathrm{mod}N\right)}{\mathrm{\Σ}}{A}_i{B}_j$

Wherein multinomial is gathered L _f, L _g, L _ω, L _mSatisfy following requirement: L _m={ coefficient of m ∈ R:m is positioned at interval [(p-1)/2, (p-1)/2] }

Definition: L (d ₁, d ₂)={ F ∈ R:F has d ₁Individual coefficient is 1, d ₂Individual coefficient is-1, and all the other coefficients are 0}, selects three positive integer d again _f, d _g, d _ω, establish multinomial set L _f, L _g, L _ωSatisfy respectively: L _f=L (d _f, d _f-1), L _g=L (d _g, d _g), L _ω=L (d _ω, d _ω)

1.1 key generates

The NTRU public key encryp is selected two polynomial f at first randomly when generating key _Key∈ L _f, g ∈ L _gRequire f _KeyContrary F about mould p and mould q _p, F _qAll exist, also promptly satisfy:

F wherein _pAnd F _qCan use the Euclidean algorithm of expansion to calculate.Calculate PKI then:

Multinomial h _KeyBe exactly the PKI of NTRU public key encryp, and polynomial f _KeyBe the private key of NTRU, simultaneously with F _pWith f _KeyPreserve together, jointly as private key.

1.2 encrypt

When communication, suppose that transmit leg S will issue message m of reciever R, S is at first from expressly collecting L _mThe message m that middle selection will send.And then from L _ωIn select a multinomial ω at random, and with the PKI h of R _KeyCalculate:

E is exactly the ciphertext that S issues R.

1.3 deciphering

After recipient R received the cipher-text message e that S sends, R was with the private key (f of oneself _Key, F _p) it is decrypted.R at first will calculate: In [q/2, q/2], select the coefficient of a, again a is carried out

Calculate, can obtain the plaintext m that S sends again.

Wherein deciphering principle is:

$a\≡f_{\mathrm{key}}\⊗e\≡f_{\mathrm{key}}\⊗\mathrm{p\ω}\⊗h_{\mathrm{key}}+f_{\mathrm{key}}\⊗m\left(\mathrm{mod}q\right)$

$=f_{\mathrm{key}}\⊗\mathrm{p\ω}\⊗F_q\⊗g+f_{\mathrm{key}}\⊗m\left(\mathrm{mod}q\right)$ (∵ $h_{\mathrm{key}}\≡F_q\⊗g\left(\mathrm{mod}q\right)$ )

$=\mathrm{p\ω}\⊗g+f_{\mathrm{key}}\⊗m\left(\mathrm{mod}q\right)$ (∵ $F_p\⊗f_{\mathrm{key}}\≡1\left(\mathrm{mod}p\right)$ )

Consider last multinomial

Because to the selectively strict restriction of NTRU parameter, all coefficients that almost always can guarantee it are all in [q/2, q/2], so after its coefficient carried out mould q, multinomial still remained unchanged, thereby has also just recovered former multinomial:

Again just having obtained multinomial behind a mould p

Again with F _pMultiply each other, just obtained message m again.

2 dynamic randomization DRNTRU public key encryps

Because the security mechanism of rfid system can realize maintaining secrecy of the information of transmitting except requiring, resist outside the attacks such as denial of service, playback information, also must be able to resist flow analysis, follow the tracks of the specific safety problem of attacking, solve rfid systems such as privacy.Thereby must guarantee that the identification code TID information that each label is read not only will communicate transmission with ciphertext in each authentication, but also will be with ciphertext transmission dynamic, change at random.In the NTRU public key encryp, by encrypting formula

As can be known: the ciphertext that obtains after the message m fixing to encrypted is all identical all the time, thereby can't satisfy the safety requirements of rfid system, must make that it possesses dynamically, the change at random function, thereby the present invention is based on the NTRU public key encryp, randomization parameter is introduced this algorithm, the NTRU algorithm is become have dynamic randomization DRNTRU public key encryp dynamic, the change at random ability.

In the present invention, order: ID, R _r, R _t, Z ∈ L _m, ω ∈ L _ω, for convenience of explanation, use ID, R at this _r, R _t, the vector representation form of Z.Select parameter p=3 of NTRU, then L _m{ coefficient of m ∈ R:m is in [1,1] interval }, identification code TID is the binary number of 64bits, available ID represents, because identification code TID is 64bits, thereby it only takies [the ID of ID ₀, ID ₁..., ID ₆₃], remaining [ID ₆₄, ID ₆₅..., ID _N-1] in native system, be used to transmit random number.R _r, R _tThe random number of using during the expression communication authentication can be utilized [ID ₆₄, ID ₆₅..., ID _N-1] position transmit, so not only can successfully random number be introduced the NTRU cryptographic algorithm but also not increase call duration time and bandwidth, establish Z=[0 ..., 0].

Definition: make v, u, w ∈ L _m, with v, u, the w vector representation, its length is N,

V=[v ₀, v ₁..., v ₆₃, v ₆₄, v ₆₅..., v _N-1] and u=[u ₀, u ₁..., u ₆₃, u ₆₄, u ₆₅..., u _N-1]

w＝[w ₀，w ₁，...，w ₆₃，w ₆₄，w ₆₅，...，w _N-1]

|| connect computing: w=v||u=[v ₀, v ₁..., v ₆₃, u ₆₄, u ₆₅..., u _N-1]

G (w, i, j) intercepting computing: g (w, i, j)=[w _i, w _I+1..., w _j]

: be XOR

Other variable, the computing used in the verification process are consistent with the NTRU public key encryp.

The concrete grammar of randomization parameter being introduced the NTRU encryption system is to original cryptographic algorithm

Plaintext m carried out revise handling, it is carried out

Conversion can be with randomization parameter R _r, R _tIntroduce this encryption system, the NTRU algorithm is become have dynamic randomization DRNTRU public key encryp dynamic, the change at random ability.

Note:

1. because ID, R _r, R _t∈ L _m, not only can use polynomial repressentation but also can use vector representation at the NTRU public key encryp, for representing consistently with NTRU, the present invention still uses polynomial repressentation, only when connecting computing and intercepting computing for ease of expressing it as Vector Processing, so ID, R _r, R _t, Z does not use black matrix small letter vector method for expressing commonly used to represent.

2. the present invention is with multinomial and random vector all are called random number at random.

Two, foundation is based on the RFID communication security mechanism of dynamic randomization DRNTRU public key encryp

2.1 condition setting at the beginning

When rfid system is initial, use the DRNTRU public key encryp to generate PKI h by server _KeyAnd private key (f _Key, F _p), and being unique identification code TID of each label distribution (can finish) by manufacturer, server is stored in label and back-end data base simultaneously with the relevant information of identification code TID and article (posting the article of this label), with PKI h _KeyAnd private key (f _Key, F _p) be stored in label and back-end data base respectively, because PKI h _KeyAnd private key (f _Key, F _p) be that system is produced by server when setting up, the private key (f that server will be wherein _Key, F _p) preserve in confidence, and with PKI h _KeyBe distributed to each label, store identification code TID into each corresponding label by escape way again simultaneously, so identification code TID and private key (f _Key, F _p) in native system, all be considered to safe and secret.

2.2 authenticating step

The communication authentication agreement of rfid system as shown in Figure 1, authenticating step is as follows:

1.Reader → Tag: read write line is gathered L from multinomial _mIn choose a random number R _r, and to label transmission authentication request Query, simultaneously with R _rSend to label;

2.Tag → Reader → Server: label is received authentication request (Query, the R that read write line is sent _r) after, at first also from multinomial set L _mIn choose a random number R _tCalculate

Again from multinomial set L _ωIn choose a random number ω, utilize PKI h _KeyC is carried out cryptographic calculation

Then with (PID, R _t) sending to read write line, read write line is again with (PID, R _t, R _r) be transmitted to server;

3.Server: server is received (PID, R _t, R _r) after, at first utilize private key (f _Key, F _p), to the PID computing of decoding:

With

Obtain C, because

C is carried out R ₁=Z||C transmits the (R of coming to read write line again _t, R _r) carry out

Then both are carried out XOR:

If the result is 0, then authentication is passed through, intercept g (C again, 0,63), can obtain identification code TID (utilizing TID just can directly in back-end data base, read the label information of this identification code TID correspondence) if this identification code TID not in the back-end data base thinks also that then it is that the illegal label refusal is accepted shut-down operation; Otherwise, authentification failure, refusal is accepted identification code TID and shut-down operation.

Below described variable of above-mentioned embodiment and expression formula are made an explanation:

Variable:

L _f, L _g, L _ω, L _m: the highest ordered coefficients that is four integral coefficients is the multinomial set of N-1, and satisfies following requirement: L _m={ coefficient of m ∈ R:m is positioned at interval [(p-1)/2, (p-1)/2] }, N wherein, p, q are three integers, p, q needn't be prime number, (p, q)=1, and q is much larger than p but require gcd.

R: be Root of Integer Polynomial ring R=Y[X]/(X ^N-1).

A: be an elements A ∈ R, its vector form can be expressed as:

R _r: be the random number that read write line produces, R _r∈ L _m

R _t: be the random number that label produces, R _t∈ L _m

Z: be N dimension null vector, Z ∈ L _m

ID: be the vector representation form of the identification code TID of label, ID ∈ L _m

PID: be the ciphertext representation of the identification code TID vector of label, PID ∈ L _m

f _Key: by the private key of the generation of DRTUN public key encryp.

h _Key: by the PKI of the generation of DRTUN public key encryp

F _p: about the contrary F of mould p _p, also promptly satisfy:

F _q: about the contrary F of mould q _q, also promptly satisfy:

Definition:

Definition 1. is as if a, and b is an integer, claims that then a and b are mould n congruences, are designated as a ≡ b (modn).

Define the greatest common factor (G.C.F.) that 2. nonnegative number d are called a and b, be designated as d=gcd (a, b).

Definition 3:L (d ₁, d ₂)={ F ∈ R:F has d ₁Individual coefficient is 1, d ₂Individual coefficient is-1, and all the other coefficients are 0}, selects three positive integer d again _f, d _g, d _ω, establish multinomial set L _f, L _g, L _ωSatisfy respectively: L _f=L (d _f, d _f-1), L _g=L (d _g, d _g), L _ω=L (d _ω, d _ω)

Definition 4: make v, u, w ∈ L _m, with v, u, the w vector representation, its length is N,

V=[v ₀, v ₁..., v ₆₃, v ₆₄, v ₆₅..., v _N-1] and u=[u ₀, u ₁..., u ₆₃, u ₆₄, u ₆₅..., u _N-1]

w＝[w ₀，w ₁，...，w ₆₃，w ₆₄，w ₆₅，...，w _N-1]

Computing:

||: for connecting computing w=v||u=[v ₀, v ₁..., v ₆₃, u ₆₄, u ₆₅..., u _N-1]

G (w, i, j): for intercepting computing g (w, i, j)=[w _i, w _I+1..., w _j]

: be XOR

: the multiplication on the representative ring R, this multiplication can be expressed as a circular convolution:

$C_k=\underset{i=0}{\overset{k}{\mathrm{\Σ}}}{A}_i{B}_{k-i}+\underset{i=k+1}{\overset{N-1}{\mathrm{\Σ}}}{A}_i{B}_{N+k-i}=\underset{i+j\≡k\left(\mathrm{mod}N\right)}{\mathrm{\Σ}}{A}_i{B}_j$

Claims (2)

1. a RFID safety communicating method of setting up based on dynamic randomization DRNTRU public key encryp is characterized in that: when rfid system is initial, use dynamic randomization DRNTRU public key encryp to generate PKI h by server _KeyAnd private key (f _Key, F _p), PKI h wherein _KeyAnd private key (f _Key, F _p) the generation method is as follows:

The NTRU public key encryp is selected two polynomial f at first randomly when generating key _Key∈ L _f, g ∈ L _g, require f _KeyContrary F about mould p and mould q _p, F _qAll exist, also promptly satisfy:

F wherein _pAnd F _qCan use the Euclidean algorithm of expansion to calculate, calculate PKI then: Multinomial h _KeyBe exactly the PKI of NTRU public key encryp, and polynomial f _KeyBe the private key of NTRU, simultaneously with F _pWith f _KeyPreserve together, jointly as private key (f _Key, F _p);

Generate PKI h _KeyAnd private key (f _Key, F _p) after, be unique identification code TID of each label distribution again, server is stored in label and back-end data base simultaneously with identification code TID and the relevant information of posting the article of this label, with PKI h _KeyAnd private key (f _Key, F _p) being stored in label and back-end data base respectively, the communication authentication protocol step of rfid system is as follows:

(1) read write line (Reader) → label (Tag): read write line is gathered L from multinomial _mIn choose a random number R _r, and to label transmission authentication request Query, simultaneously with R _rSend to label;

(2) label (Tag) → read write line (Reader) → server (Server): label is received authentication request (Query, the R that read write line is sent _r) after, at first also from multinomial set L _mIn choose a random number R _tCalculate

Again from multinomial set L _ωIn choose a random number ω, utilize PKI h _KeyC is carried out cryptographic calculation Then with (PID, R _t) sending to read write line, read write line is again with (PID, R _t, R _r) be transmitted to server;

(3) server (Server): server is received (PID, R _t, R _r) after, at first utilize private key (f _Key, F _p), to the PID computing of decoding:

With

Obtain C, because

C is carried out R ₁=Z||C transmits the (R of coming to read write line again _t, R _r) carry out

Then both are carried out XOR:

If the result is 0, then authentication is passed through, and intercepts g (C, 0,63) again, can obtain identification code TID; Otherwise, authentification failure, refusal is accepted identification code TID and shut-down operation;

The variable that relates in the such scheme, definition and oeprator are respectively described below:

L _f, L _g, L _ω, L _m: be the Root of Integer Polynomial set that four ordered coefficients the highest are N-1

P, q: be two integers, p, q needn't be prime number, (p, q)=1, and q is much larger than p but require gcd

R _r: be the random number that read write line produces, R _r∈ L _m

R _t: be the random number that label produces, R _t∈ L _m

Z: be N dimension null vector, Z ∈ L _m

ID: be the vector representation form of the identification code TID of label, ID ∈ L _m

PID: be the ciphertext representation of the identification code TID vector of label, PID ∈ L _m

f _Key: by the private key of the generation of DRTUN public key encryp

h _Key: by the PKI of the generation of DRTUN public key encryp

F _p: about the contrary F of mould p _p, also promptly satisfy:

F _q: about the contrary F of mould q _q, also promptly satisfy:

||: connect computing

G (C, 0,63): expression utilizes intercepting computing g (w, i, j) 0 to 63 of the vectorial C of intercepting

Mod: modulo operation

Be XOR

Multiplication on the representative ring R, this multiplication can be expressed as a circular convolution:

2. the RFID safety communicating method of setting up based on dynamic randomization DRNTRU public key encryp according to claim 1, it is characterized in that: described dynamic randomization DRNTRU public key encryp is based on the NTRU public key encryp, with randomization parameter R _r, R _tIntroduce the NTRU encryption system, make the NTRU encryption system become dynamic randomization DRNTRU public key encryp, randomization parameter R _r, R _tThe concrete grammar of introducing the NTRU encryption system is to original cryptographic algorithm

The plaintext m processing of making amendment, it is carried out

Conversion, ID wherein, R _r, R _t∈ L _m, ω ∈ L _ω, parameter p=3 of selection NTRU, then L _m={ coefficient of m ∈ R:m is in [1,1] interval }, identification code TID is the binary number of 64bits, represents with ID, it only takies [the ID of Id ₀, ID ₁..., ID ₆₃], remaining [ID ₆₄, ID ₆₅..., ID _N-1] be used to transmit random number R _r, R _t

Images