CN103825725B - A kind of efficient random physical layer key generation method based on vector quantization - Google Patents

Abstract

The invention discloses a kind of efficient random physical layer key generation method based on vector quantization.According to the present invention, the wireless communication both sides simultaneously RSS information of detection wireless channel be transferred to the other side respectively, wireless communication both sides take discordance removal, vector quantization and fuzzy extraction step to operate simultaneously, finally give identical bit stream and use as encryption key.The bit production rate of the present invention can reach 284%, can be that under wireless network environment, the authentication encryption algorithm of communicating pair quickly provides random bit stream as encryption key；Communicating pair can reach zero bit error rate, it is ensured that communicating pair is reliably produce on all four bit stream as encryption key, it is ensured that present invention stability during using；The bit stream that the present invention produces can pass through NIST Randomness test, can produce random bit stream as key, it is ensured that the secure communication of communicating pair.

Description

A kind of efficient random physical layer key generation method based on vector quantization

Technical field

This invention belongs to wireless network secure field, relates to one and is efficiently randomly generated for cryptographic algorithm from physical layer The method of safe key and relevant apparatus.In general, can to meet wireless network secure field close to safety in this invention The generation speed of key and the requirement of security intensity.

Background technology

Various wireless devices have become as a part indispensable in our daily life, by these equipment We can carry out information sharing and data exchange.Such as, one group of visitor needs to be shared picture by point-to-point connection, regarded The resources such as frequency, prevent others to access these resources simultaneously again.In order to enable to dispose and use these to apply safely, it is ensured that number Just it is particularly important according to confidentiality, integrity and the authentication property of transmission.

The broadcast characteristic of wireless network makes it face the safety problem bigger than cable network, and assailant can be easier Eavesdropping or the Content of Communication of intercepting legitimate node, wireless device can be modified or counterfeiting to carry out some malicious acts.

Existing wireless encryption system also exists many weak points in some scene, specific as follows:

(1) existing 802.11 safe practices are that Frame provides certification and privacy mechanism, but manage frame and control frame It is not protected.

(2) theoretical basis of existing security system is that mathematical difficult problem is (such as Large integer factoring problem and discrete right Number computational problem).Along with the appearance of the development of computing technique, particularly quantum computer, the computing capability of assailant significantly carries Rising, the safety of these cryptographic techniques based on computational complexity will reduce.

(3) most cryptographic technique, particularly public key cryptography have higher complexity and calculate requirement, so being not suitable for It is applied in the low distributed wireless networks joined.

(4) traditional security mechanism based on shared key needs key management, distributes, updates and safeguard, along with node The increase of number, required key number exponentially increases, and key distribution and the workload updated can be the biggest.And at Ad hoc In network, node frequently joins and departs from network, and this makes key management more difficult.

Based on above reason, introducing safety of physical layer strengthens the scheme of wireless network secure and receives increasing pass Note.Physical layer key is based on Information theoretical secure, and it can reduce the difficulty of encryption key distribution and renewal, it is achieved layer security, Improve the safety of existing key code system.

The scheme producing key from physical layer needs based on physical layer channel information.These information include arriving angle Degree, phase place, received signal strength (RSS), channel impulse response (CIR), signal envelope and cross-point etc..Wherein, receive Signal intensity (RSS) is the common method generating key, this is because RSS directly can be obtained by existing network interface card.

In general, the standard weighing physical layer key generation method good and bad includes following three kinds:

(1) bit production rate: the key bit number that single RSS ultimately generates；

(2) the key bit error rate: communicating pair generates in key and do not mates the figure place of key and the ratio of key total length；

(3) key randomness: generate the uniformity coefficient of 0 and 1 distribution in the binary stream of key.

Currently, all there is identical problem in the physical layer key generation method that wireless network secure field exists, i.e. these Method all can not meet higher bit production rate, low error rate, the requirement of high randomness simultaneously.They mostly sacrifice bit production rate To reduce the bit error rate, and the key generation method of poor efficiency causes node to need to consume big energy carrying out repeatedly sounding channel to produce The key of raw sufficient length.

Summary of the invention

In view of the deficiencies in the prior art, it is desirable to provide a kind of efficient random physical layer key based on vector quantization Production method, produces random bit stream rapidly and provides reliable key for communicating pair encryption and certification under wireless environment.

To achieve these goals, the technical solution used in the present invention is as follows:

A kind of efficient random physical layer key generation method based on vector quantization, wireless communication both sides are respectively The RSS information of detection wireless channel be transferred to the other side simultaneously, wireless communication both sides take discordance to go simultaneously Remove, vector quantization and fuzzy extraction step operate, and finally give identical bit stream and use as encryption key.

Described method comprises the steps:

Step 1, discordance are removed: remove the inconsistent channel letter caused due to transmission channel half-duplex or ambient noise Breath；

Step 2, vector quantization: RSS is divided into two intervals according to average line, finally discontinuous RSS value is converted It it is 0,1 bit stream；

Step 3, fuzzy extraction: wireless communication both sides utilize Fuzzy extractor to generating position inconsistent in bit stream Carry out error correction and export identical bit stream as encryption key.

Further, discordance removal stage (step 1) comprises the steps:

Step 1.1, input: RSS array X={x collected₁,x₂,…,x_k, x_i∈Z；

Step 1.2, piecemeal: RSS value is carried out piecemeal, be referred to as block by block, and k RSS value is different by belonging to In block, make a length of b of each block, it is assumed that total t block；

Step 1.3, use label function R (x_i) RSS value is quantified, the RSS value not being quantized is abandoned；

Step 1.4, definition m are improvement factor, and wireless communication Party A generates 0,1 sequence according to label function, runs into Continuously m position identical 0 or 1, then by the sequence number record of interposition at L_{a_to_b}In array, generate L_{a_to_b}={ l₁,l₂,…,l_a, And it is sent to wireless communication Party B；

Step 1.5, wireless communication Party B according to label function generate 0,1 sequence, run into continuous m position identical 0 or 1, then by the sequence number record of interposition at L_{b_to_a}In array, and and L_{a_to_b}Array contrasts, and rejects inconsistent sequence number, raw The L of Cheng Xin_{b_to_a}Array is also sent to wireless communication Party A.

It should be noted that described label function R (x_i) it is:

Wherein, with reference to boundary array it is $Q+=\{q_1^{+},q_2^{+},...,q_t^{+}\}$ With $Q-=\{q_1^{-},q_2^{-},...,q_t^{-}\},$ $q_i^{+}={\mathrm{mean}}_i+\mathrm{\α}*\mathrm{std}\_{\mathrm{derivation}}_i,q_i^{-}={\mathrm{mean}}_i-\mathrm{\α}*\mathrm{std}\_{\mathrm{derivation}}_i,$ mean_iFor the RSS meansigma methods of i-th block, α be fluctuate because of Son and α ∈ (0,1), std_derivation_iIt it is the RSS standard deviation of i-th block.

Further, vector quantization stage (step 2) comprises the steps:

Step 2.1, input through discordance remove after effective RSS array Y and the dimension N of vector quantization；

Step 2.2, for each y in array Y_iAll set up N-dimensional vector；

Step 2.3, to each y_iAll apply N-dimensional vector quantizer Q_N(y_i), will quantify after produce 0,1 bit stream as Output.

It should be noted that RSS array Y in described step 2.1 is: Y={y₁,y₂,…,y_d, y_iIn ∈ Z, Y array RSS value be L_{b_to_a}RSS value corresponding to each sequence number in array.

It should be noted that described step 2.2 is y_iThe N-dimensional vector set up is:

$<y_i,y_{(i+{\mathrm{\&Delta;}}_1)\mathrm{mod}d},y_{(i+{\mathrm{\&Delta;}}_1+{\mathrm{\&Delta;}}_2)\mathrm{mod}d},...,y_{(i+{\mathrm{\&Delta;}}_1+...+{\mathrm{\&Delta;}}_{N-1})\mathrm{mod}d}>$ Wherein, Δ={ Δ₁,Δ₂,…,Δ_N-1It it is N-dimensional The component interval of N number of component, Δ in vector_jIt it is the sequence number interval between jth component and+1 component of jth.

Need it is further noted that N-dimensional vector quantizer Q in described step 2.3_N(y_i) it is:

$Q_N\left(y_i\right)=R\left(y_i\right)R\left(y_{(i+{\mathrm{\&Delta;}}_1)\mathrm{mod}d}\right)...R\left(y_{(i+{\mathrm{\&Delta;}}_1+...+{\mathrm{\&Delta;}}_{N-1})\mathrm{mod}d}\right),$ Wherein, y_iRSS for the input of N-dimensional vector quantizer Value.

In fuzzy extraction process (step 3), Fuzzy extractor can be defined as:<Gen, Rep>, parameter be (M, l, t), its In, process Gen is that probability generates process, and process Rep is definitiveness recovery process, and M is incoming bit stream set, and l is input ratio Special stream length, t is that the ultimate range between the message of wireless communication Party A and wireless communication Party B input limits.

First described process Gen is operated by wireless communication Party A, then passes to wireless by parameter P of output Network service Party B, wireless communication Party B operates according still further to process Rep, wireless communication Party A and wireless communication Party B produces on all four random secret information R as encryption key.

Process Gen is: (R, P) ← Gen (w₀), wherein, input parameter w₀For the bit stream of a length of l, output parameter R is The random secret information of a length of l, output parameter P is public information.

Process Rep is: R ← Rep (w', P), and wherein, input parameter w' is a length of l and and w₀Distance be not more than t's Bit stream, input parameter P be process Gen generate the public information for error correction, output parameter R be a length of l with Gen mistake The random secret information of Cheng Xiangtong.

It should be noted that process Gen can preferentially be adopted realization with the following method but is not limited to following method: utilize Bose-Chaudhuri Hocquenghem error correction codes is to w₀Just error correction, the error correcting code of generation, as P, utilizes SHA-1 algorithm to w₀Carry out Hash process, Hash defeated Enter with output length ratio for 1:1, generate the strong key of randomness as R.

It should be noted that process Rep can preferentially be adopted realization with the following method but is not limited to following method: utilize The error correction sequence P produced during Bose-Chaudhuri Hocquenghem error correction codes and Gen carries out error correction to w', recovers w₀Sequence, utilizes SHA-1 algorithm to w₀ Carrying out Hash process, the input of Hash and output length ratio for 1:1, generate the strong key of randomness as R.

The present invention has the beneficial effects that:

(1) the bit production rate of the present invention can reach 284%, and average each RSS value can produce 2.84 bits, Can be that under wireless network environment, the authentication encryption algorithm of communicating pair quickly provides random bit stream as encryption key；

(2) present invention is in the application, and communicating pair can reach zero bit error rate, it is ensured that communicating pair is reliably produce On all four bit stream is as encryption key, it is ensured that present invention stability during using；

(3) bit stream that the present invention produces has passed through NIST Randomness test, can be that authentication encryption algorithm provides random Bit stream as encryption key, it is ensured that the secure communication of communicating pair.

Accompanying drawing explanation

Fig. 1 is the schematic flow sheet of the present invention；

Fig. 2 is that two-dimensional vector quantifies schematic diagram；

Fig. 3 is the organigram of Fuzzy extractor.

Detailed description of the invention

Below in conjunction with drawings and Examples, the invention will be further described.

As it is shown in figure 1, the present invention is Replication Approach in Mobile Environment, efficient random physical layer key based on vector quantization produces Method, wireless communication both sides Alice and the Bob simultaneously RSS information of detection wireless channel be transferred to the other side, both sides respectively Take this method to operate simultaneously, finally give identical bit stream and use as encryption key.

Described method comprises the steps:

Step 1, discordance are removed: remove the inconsistent channel letter caused due to transmission channel half-duplex or ambient noise Breath；

Step 2, vector quantization: RSS is divided into two intervals according to average line, finally discontinuous RSS value is converted It it is 0,1 bit stream；

Step 3, fuzzy extract: both sides utilize Fuzzy extractor to carry out error correction defeated to generating inconsistent position in bit stream Go out identical bit stream as encryption key.

Further, discordance removal stage (step 1) comprises the steps:

Step 1.1, input: RSS array X={x collected₁,x₂,…,x_k, x_i∈Z；

Step 1.2, piecemeal: RSS value is carried out piecemeal, be referred to as block by block, and k RSS value is different by belonging to In block, make a length of b of each block, it is assumed that total t block；

Step 1.3, use label function R (x_i) RSS value is quantified, the RSS value not being quantized is abandoned；

Step 1.4, definition m are improvement factor, and Alice generates 0,1 sequence according to label function, runs into continuous m position identical 0 or 1, then by the sequence number record of interposition at L_{a_to_b}In array, generate L_{a_to_b}={ l₁,l₂,…,l_a, and it is sent to Bob；

Step 1.5, Bob generate 0,1 sequence according to label function, and run into that continuous m position is identical 0 or 1, then by interposition Sequence number record is at L_{b_to_a}In array, and and L_{a_to_b}Array contrasts, and rejects inconsistent sequence number, generates new L_{b_to_a}Number Group is also sent to Alice.

It should be noted that described label function R (x_i) it is:

Wherein, with reference to boundary array it is $Q+=\{q_1^{+},q_2^{+},...,q_t^{+}\}$ With $Q-=\{q_1^{-},q_2^{-},...,q_t^{-}\},$ $q_i^{+}={\mathrm{mean}}_i+\mathrm{\&alpha;}*\mathrm{std}\_{\mathrm{derivation}}_i,q_i^{-}={\mathrm{mean}}_i-\mathrm{\&alpha;}*\mathrm{std}\_{\mathrm{derivation}}_i,$ mean_iFor the RSS meansigma methods of i-th block, α be fluctuate because of Son and α ∈ (0,1), std_derivation_iIt it is the RSS standard deviation of i-th block.

Further, vector quantization stage (step 2) comprises the steps:

Step 2.1, input through discordance remove after effective RSS array Y and the dimension N of vector quantization；

Step 2.2, for each y in array Y_iAll set up N-dimensional vector；

Step 2.3, to each y_iAll apply N-dimensional vector quantizer Q_N(y_i), will quantify after produce 0,1 bit stream as Output.

It should be noted that RSS array Y in described step 2.1 is: Y={y₁,y₂,…,y_d, y_iIn ∈ Z, Y array RSS value be L_{b_to_a}RSS value corresponding to each sequence number in array.

It should be noted that described step 2.2 is each y_iThe N-dimensional vector set up is: $<y_i,y_{(i+{\mathrm{\&Delta;}}_1)\mathrm{mod}d},y_{(i+{\mathrm{\&Delta;}}_1+{\mathrm{\&Delta;}}_2)\mathrm{mod}d},...,y_{(i+{\mathrm{\&Delta;}}_1+...+{\mathrm{\&Delta;}}_{N-1})\mathrm{mod}d}>$ Wherein, Δ={ Δ₁,Δ₂,…,Δ_N-1It is in N-dimensional vector The component interval of N number of component, Δ_jIt it is the sequence number interval between jth component and+1 component of jth.

Need it is further noted that N-dimensional vector quantizer Q in described step 2.3_N(y_i) it is: $Q_N\left(y_i\right)=R\left(y_i\right)R\left(y_{(i+{\mathrm{\&Delta;}}_1)\mathrm{mod}d}\right)...R\left(y_{(i+{\mathrm{\&Delta;}}_1+...+{\mathrm{\&Delta;}}_{N-1})\mathrm{mod}d}\right),$ Wherein, y_iRSS value for the input of N-dimensional vector quantizer.

Two-dimensional vector quantifies as in figure 2 it is shown, work as and input as y_iTime, with Δ_iSecond component is found backward for intervalComposition two-dimensional vectorAnd calculate label function-output R (y according to the two component_i) andThis label output valve of twoIt is 01,01 to be y_iTwo-dimensional vector quantify defeated Go out.

As it is shown on figure 3, in fuzzy extraction process (step 3), Fuzzy extractor can be defined as:<Gen, Rep>, and parameter is (M, l, t), wherein, process Gen is that probability generates process, and process Rep is definitiveness recovery process, and M is incoming bit stream set, L is incoming bit stream length, t be Alice and Bob input message between ultimate range limit.

First described process Gen is operated by Alice, then the parameter of output is passed to Bob, and Bob is according still further to mistake Journey Rep operates, Alice and Bob produces on all four random secret information R as encryption key.

Process Gen is: (R, P) ← Gen (w₀), wherein, input parameter w₀For the bit stream of a length of l, output parameter R is The random secret information of a length of l, output parameter P is public information.

Process Rep is: R ← Rep (w', P), and wherein, input parameter w' is a length of l and and w₀Distance be not more than t's Bit stream, input parameter P be Gen process generate the public information for error correction, output parameter R be a length of l with Gen mistake The random secret information of Cheng Xiangtong.

Embodiment

In the present embodiment, communicating pair Alice and Bob is separately operable on two PC, and the operating system of lift-launch is Ubuntu12.04, uses the network interface card Atheros TL-WN650G of same model, Madwifi drives, be operated in 802.11g Transmitting-receiving bag under pattern.In this implementation process, Madwifi is modified by we, with the addition of the reply to beacon frame, Beacon_ack frame carries the serial number identical with beacon frame, and by the coupling of serial number, communicating pair can complete RSS's Pairing, a length of 49 bytes of beacon_ack.Bob moves back and forth around Alice and sends out to Alice for interval with 100ms Sending beacon frame, Alice can record serial number and corresponding RSS value after receiving beacon frame, and sends one to Bob at once The acknowledgement frame of beacon_ack.After Bob receives acknowledgement frame, record serial number and corresponding RSS value equally.At the present embodiment In, have collected 120000 RSS altogether.

Step one, discordance is removed.

Due to Alice and Bob measure RSS value time there will be some errors, the fluctuating margin of both sides the most always as, So RSS piecemeal is processed, calculate for each piece and quantify bound, the RSS of Alice with Bob in each piece can be made similar Du Genggao, thus reduce the bit error rate.In the present embodiment, the size block value of RSS sequence piecemeal is 80.

Fluctuation factor-alpha is the important factor in order reducing the bit error rate, α the biggest (little), with reference to boundary Q⁺And Q^-Range averaging line Distance the most remote (closely), there is the probability the highest (low) that the point of little deviation is disallowable, the bit error rate can decline (rising), but with Time two with reference to the point being rejected the most (lack) between boundaries, bit production rate decline (rising) can be caused.In this reality Executing in example, α value is 0.2.

Improvement factor m is the biggest, meets continuous m position and is both greater than Q⁺Or less than Q^-Point the fewest, consult generate effective RSS value The fewest, so can significantly reduce along with m increases bit production rate, and m increases the feelings meaning the RSS significantly saltus step of continuous m position Condition reduces, so the bit error rate can decline accordingly；Otherwise, m reduces then effective RSS number and can be greatly increased, and bit production rate increases Adding, and the situation of m position significantly saltus step continuously increases, the bit error rate reduces, and in the present embodiment, m value is 2.

Step 2, vector quantization.

N-dimensional vector quantization represents the output of the input correspondence N number of bit of generation of an effective RSS, so the biggest bit of N Exporting the longest, the bit stream being available for generating key is the biggest, finally makes bit production rate increase.But N means the most greatly bit The increased number reused, the independence between bit reduces, and randomness weakens.In the present embodiment, Δ is chosen₁=Δ₂=...= Δ_N-1=60, the distribution ratio that vector corresponding for the most each RSS is mapped on N-dimensional solid axes is more uniform, in addition the choosing of Δ Take and bit production rate and the bit error rate are not the most affected.

Step 3, fuzzy extraction.

In the present embodiment, the process carrying out fuzzy extraction is as follows:

(1) Alice generates bit stream w by vector quantization₀, as the input of Gen, by BCH (23,12) Error Correction of Coding Generate error correction sequence P, and to w₀Carrying out SHA-1 Hash and generate the key that randomness is strong, the input of Hash with output length ratio is 1:1。

(2) Alice error correction sequence P is sent to Bob, Bob use P to oneself quantify generate bit stream w' entangle Mistake, recovers w₀Sequence, carries out SHA-1 Hash the most equally and generates identical random key.

BCH (23, the 12) true form a length of 12 chosen in this process, error correction code length is 11, and its minimum distance is 7,3 mistakes can be corrected.Bit stream is divided into every 12 one group by us, generates 11 corresponding error correcting codes and is sent to communication The other side, these 11 error correcting codes can at most correct 3 bit-errors in 12 true forms.After BCH code error correction, Alice and Bob generates Key completely the same, there is not any error bit, reach zero bit error rate.

For a person skilled in the art, can technical scheme as described above and design, make other each Kind corresponding change and deformation, and all these changes and deformation all should be at the protection domain of the claims in the present invention Within.

Claims (7)

1. an efficient random physical layer key generation method based on vector quantization, it is characterised in that:

The wireless communication both sides simultaneously RSS information of detection wireless channel be transferred to the other side respectively, wireless network leads to Letter both sides take discordance removal, vector quantization and fuzzy extraction step to operate simultaneously, finally give identical Bit stream uses as encryption key；

Described method comprises the steps:

Step 1, discordance are removed: remove the inconsistent channel information caused due to transmission channel half-duplex or ambient noise； Described step 1 comprises the steps:

Step 1.1, input: RSS array X={x collected₁,x₂,…,x_k},x_i∈Z；

Step 1.2, piecemeal: RSS value is carried out piecemeal, be referred to as block by block, and k RSS value will belong in different block, Make a length of b of each block, it is assumed that total t block；

Step 1.3, use label function R (x_i) RSS value is quantified, the RSS value not being quantized is abandoned；

Step 1.4, definition m are improvement factor, and wireless communication Party A generates 0,1 sequence according to label function, runs into continuous m Position identical 0 or 1, then by the sequence number record of interposition at L_{a_to_b}In array, generate L_{a_to_b}={ l₁,l₂,…,l_a, and send To wireless communication Party B；

Step 1.5, wireless communication Party B generate 0,1 sequence according to label function, run into that continuous m position is identical 0 or 1, then By the sequence number record of interposition at L_{b_to_a}In array, and and L_{a_to_b}Array carries out contrast and rejects inconsistent sequence number, generates new L_{b_to_a}Array is also sent to wireless communication Party A；

Label function R (x in described step 1.3_i) it is:

Definition with reference to boundary array isWithWherein, mean_iFor the RSS meansigma methods of i-th block, α be fluctuate because of Son and α ∈ (0,1), std_derivation_iIt it is the RSS standard deviation of i-th block；

Step 2, vector quantization:

Step 2.1, input through discordance remove after effective RSS array Y and the dimension N of vector quantization to be carried out；

Step 2.2, for each y in array Y_iAll set up N-dimensional vector；

Step 2.3, to each y_iAll apply N-dimensional vector quantizer Q_N(y_i), 0,1 bit stream produced after quantifying is as output；

RSS array Y in described step 2.1 is: Y={y₁,y₂,…,y_d, y_iRSS value in ∈ Z, Y array is L_{b_to_a}Array In RSS value corresponding to each sequence number；

Described step 2.2 is y_iThe N-dimensional vector set up is:

$<y_i,y_{(i+{\mathrm{\&Delta;}}_1)\mathrm{mod}d},y_{(i+{\mathrm{\&Delta;}}_1+{\mathrm{\&Delta;}}_2)\mathrm{mod}d},...,y_{(i+{\mathrm{\&Delta;}}_1+...+{\mathrm{\&Delta;}}_{N-1})\mathrm{mod}d}>$

Wherein, Δ={ Δ₁,Δ₂,…,Δ_N-1Be N number of component in N-dimensional vector component interval, Δ_jIt is jth component and jth Sequence number interval between+1 component；

N-dimensional vector quantizer Q in described step 2.3_N(y_i) it is:

Wherein, y_iRSS value for the input of N-dimensional vector quantizer；

Step 3, fuzzy extraction: wireless communication both sides utilize Fuzzy extractor to carry out generating inconsistent position in bit stream Error correction also exports identical bit stream as encryption key.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 1, its feature Being, the Fuzzy extractor in described step 3 can be defined as:<Gen, Rep>, and parameter is (M, l, T), and wherein, process Gen is Probability generates process, and process Rep is definitiveness recovery process, and M is incoming bit stream set, and l is incoming bit stream length, and T is Ultimate range between the message of wireless communication Party A and wireless communication Party B input limits.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 2, its feature Being, first described process Gen is operated by wireless communication Party A, then the parameter of output is passed to wireless network Communication Party B, wireless communication Party B operates according still further to process Rep, wireless communication Party A and wireless communication Party B Produce on all four random secret information R as encryption key.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 2, its feature Being, described process Gen is: (R, P) ← Gen (w₀), wherein, input parameter w₀For the bit stream of a length of l, output parameter R is The random secret information of a length of l, output parameter P is public information.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 4, its feature Being, described process Rep is: R ← Rep (w', P), and wherein, input parameter w' is a length of l and and w₀Distance be not more than T's Bit stream, input parameter P be Gen process generate the public information for error correction, output parameter R be a length of l with Gen mistake The random secret information of Cheng Xiangtong.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 4, its feature Being, described process Gen can preferentially be adopted realization with the following method but is not limited to following method: utilize Bose-Chaudhuri Hocquenghem error correction codes to w₀ Carrying out error correction, the error correcting code of generation, as P, utilizes SHA-1 algorithm to w₀Carry out Hash process, the input of Hash and output length Ratio is 1:1, generates the strong key of randomness as R.

A kind of efficient random physical layer key generation method based on vector quantization the most according to claim 5, its feature Being, described process Rep can preferentially be adopted realization with the following method but is not limited to following method: utilize Bose-Chaudhuri Hocquenghem error correction codes and Gen During produce error correction sequence P w' is carried out error correction, recover w₀Sequence, utilizes SHA-1 algorithm to w₀Carry out Hash process, The input of Hash and output length ratio for 1:1, generate the strong key of randomness as R.