CN107528687B - Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation - Google Patents
Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation Download PDFInfo
- Publication number
- CN107528687B CN107528687B CN201710905539.5A CN201710905539A CN107528687B CN 107528687 B CN107528687 B CN 107528687B CN 201710905539 A CN201710905539 A CN 201710905539A CN 107528687 B CN107528687 B CN 107528687B
- Authority
- CN
- China
- Prior art keywords
- key
- quantization
- data
- grouping
- bit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
Abstract
The dynamic key that the invention discloses a kind of based on radio physical layer channel characteristics quantifies machinery of consultation, and it is low to solve existing quantization machinery of consultation key generating rate, the lower problem of entropy.Quantifying negotiations process includes: that data communication both sides acquire communication data information in advance, parameter is negotiated in initialization key quantization, it communicates a side Dynamic Packet slope is successively carried out to one piece of data every after segmentation and quantify to obtain initial key, communicating pair is according to grouping subscript record array and gives up array to initial key progress key agreement, and final both sides respectively obtain final key.The present invention improves key stream generating rate, and 128-256bit key stream can be generated in 200 seconds or so durations.It ensure that key stream entropy is higher, better than upper and lower interval quantization algorithm and fixed grouping slope quantization algorithm.The present invention is applied to the key in wireless network coded communication and generates negotiation, realizes safety communication.
Description
Technical field
The invention belongs to wireless network secure technical field, the key quantization related generally in wireless communication is negotiated,
Specifically a kind of dynamic key based on physical layer channel cross correlation quantifies machinery of consultation, is used for wireless network safety communication.
Background technique
The communication channel for establishing a safety is the basic and most important security needs of wireless network, because of wireless network
Be related to we routine safety and security application various aspects.Traditional Security Mechanism of Intra-Network is supported to protect dependent on key
Close and authentication service.
However, in dynamic mobile wireless environment, even association reciprocity between mobile entity immediately, it is also difficult to guarantee
The availability of one certificate management authority or Key Management Center.By means of in wireless network environment wireless terminal (STA) with
The wireless channel established between access point (AP) has certain cross correlation, the wireless communication shared using the both sides with correlation
Road feature carries out key quantization and negotiates, and therefrom extracts the key stream for guaranteeing certain security intensity enough.
Recent trend about this respect is to extract key using the received signal strength (RSS) of wireless channel.It receives
Signal strength (RSS) is a popular statistics of radio channel, and may be used as sharing between transmitter and receiver
The source of secret information.
Traditional method for carrying out key quantization using RSS and negotiating, such as the quantization method based on upper and lower interval threshold,
There are many shortcomings, and especially in static situation: (1) its deadly defect is that bit production rate is low；(2) key generated
With low entropy (sequence with continuous multiple 0 or continuous multiple 1), confidentiality is reduced；(3) letter of prediction can not effectively be resisted
Road attack, because if channel is periodically blocked, the reading of RSS will be increased or decreased.
Summary of the invention
The purpose of the present invention is in view of the deficiencies of the prior art, proposing that a kind of key generating rate is fast, key entropy is higher
Dynamic key based on physical layer channel cross correlation quantify machinery of consultation.
The present invention is a kind of dynamic key quantization machinery of consultation based on radio physical layer channel characteristics, which is characterized in that
It comprises the following steps that
Step 1: the both sides of data communication acquire communication data information in advance: both sides establish a kind of with cross correlation first
Wireless channel, interacted within the set time, respectively obtain and send fixed duration according to fixed transmission rate and collected
Data packet, respectively extract the channel characteristic value in each data packet, respectively form a string for key quantization input numbers
According to；
Step 2: both sides' initialization key quantization parameter of data communication: both sides are respectively to the input number quantified for key
According to being segmented, the datum mark of every section of initial packet is initialized as first data point of this section, and every section of grouping serial number is from 1
Start, and slope threshold value is set；
Step 3: a side of data communication successively carries out Dynamic Packet slope quantization to every one piece of data after segmentation:
One side of 3.1 data communications chooses the first segment data, since the datum mark of this section, successively by data point later
It is compared with datum mark, if the absolute value of the difference of current data point and datum mark is greater than slope threshold value, carries out key
Quantization, generates a bit, and records the terminal that current data point is current group, and data point subscript is stored under grouping
In label record, grouping serial number increases by 1, and the datum mark of next grouping is the terminal of a upper grouping；Otherwise give up the data point, into
The comparison of the next data point of row, until terminating the grouping generates a bit；This process completes the bit quantity of a grouping
Change；
One side of 3.2 data communications successively will carry out Dynamic Packet quantization, a grouping according to step 3.1 to the segment data
Quantization generates one and only one bit, and the bit that each group quantization is generated successively is stored in quantization bit string
In, if quantization bit string is sky, a bit being currently generated is quantization bit string；Otherwise by a ratio of generation
Spy is spliced to quantization bit string tail portion；This process completes the packet bit quantization of one piece of data；
One side of 3.3 data communications carries out bit quantization according to step 3.2 to every one piece of data, every by what is obtained after quantization
One section quantization bit string successively carry out splicing and generate original quantisation key, obtain key quantization as a result, i.e. original quantisation key
With grouping subscript record；
Step 4: the both sides of data communication carry out cipher key agreement process with array is given up according to grouping subscript record, specific to assist
Quotient's process includes:
Grouping subscript record in key quantized result is sent to another party by one side of 4.1 data communications；
Another party of 4.2 data communications receive other side grouping subscript record after, according to grouping subscript record to oneself
Input data for key quantization is successively grouped key quantization, by the grouping subscript if current group is without bit is generated
It is recorded in and gives up in array；Otherwise the bit of generation is stored in quantization bit string, if quantization bit string is sky, when
Previous existence at a bit be quantization bit string；Otherwise a bit of generation is spliced to quantization bit string tail portion,
After quantization another party obtained key quantization as a result, i.e. quantization bit string with give up array, another party will give up array
It is sent to other side, the quantization bit string quantization key final as another party；
The other side of 4.3 data communications receive another party give up array after, according to giving up array successively to oneself original vol
The respective packets quantization bit changed in key is given up, and final quantization key is obtained, and completes both sides' cipher key agreement process；
Step 5: the key quantization negotiations process of the both sides of data communication terminates, and both sides, which respectively obtain a string, has peace enough
01 bit key stream of overall length 128-256bit quantifies to realize wireless encryption communication in the environment of arranging key herein.
In the present invention, it does not use fixed threshold value and generates key, but with the RSS value of two channel characteristics data points
Difference, that is, slope value, key is quantified.Using the present invention, more healthy and stronger key can be generated in the shorter time.
Compared with prior art, technical advantage of the invention:
1. quantizing process of the present invention uses Dynamic Packet method, in conjunction with slope threshold value quantization method, when data point and benchmark
The absolute value of the difference of point meets threshold requirement, an effectively grouping can be divided into, by effective grouping of channel characteristics data
Number increases substantially, and the average packet length of Dynamic Packet method is less than fixed grouping length set in fixed group technology
Degree, thus it is higher using the generating rate that the method for the present invention generates key, it is demonstrated experimentally that being generated in 200 seconds using the present invention
The bit key stream of 128-256bit or so, Dynamic Packet quantization machinery of consultation effectively increase key generating rate；
2. the present invention is using this feature of difference between adjacent channel data point, to greatest extent on protect and describe the number of channel
According to characteristic so that quantization arranging key entropy is higher, also just because of present invention key generated has higher entropy, it is ensured that
The safety of data confidentiality in wireless communication；
3. the channel characteristic value that the method for the present invention when carrying out quantization key generation, will not be received by data communication both sides
Existing Influence of Displacement, because used data characteristics is the difference at consecutive number strong point, the deviant for being included by data point
It is offset, therefore the existing displacement of channel characteristics data does not have any influence to quantization arranging key generating rate, entropy, more
Better than existing interval threshold quantization algorithm before.
4. in cipher key agreement process of the present invention, interaction data is only to be grouped subscript record array and give up array, and array is deposited
Storage is the subscript of data point, rather than data point RSS value, does so the safety that preferably ensure that RSS data, i.e., not outward
Boundary sends any and related content of RSS value, even if listener-in's capture obtains the two arrays, can not therefrom recover quantization
Key.This has resisted prediction channel attack to a certain extent, enhances the safety in cipher key agreement process.
Detailed description of the invention
Fig. 1 is that key of the invention quantifies flow diagram；
Fig. 2 is that communicating pair of the invention quantifies line chart；
Fig. 3 is communicating pair key agreement timing diagram of the invention.
Specific embodiment
With reference to the accompanying drawing to the detailed description of the invention,
Embodiment 1
The quantization method based on upper and lower interval threshold in the key quantization machinery of consultation of existing wireless communications, it is fatal weak
Point is that key bit generating rate is low, and key entropy generated is lower, can not efficiently resist attacker to the sudden and violent of key
Power cracks, and reduces confidentiality.For this status, the present invention expands research and innovation, proposes a kind of based on radio physical layer
The dynamic key of channel characteristics quantifies machinery of consultation, in the wireless network environment framework based on 802.11 agreements, generally by nothing
Line terminal and access point are constituted, and wireless terminal sends probe request to access point with active scan mode, and access point receives spy
After surveying claim frame, probing response frame is sent to respond wireless terminal, this procedure communication both sides just establish in wireless space
One wireless channel, channel characteristics possessed by this channel are unique in wireless communication Theoretical Physics level, two
Two channels are different, but channel characteristics received by the communicating pair that is connected of channel be it is theoretical consistent, in reality situation
It can be influenced by factors such as ambient noises, but still there is stronger cross correlation.In this example, the mutual of this physical layer channel is utilized
Correlation obtains one group of channel characteristics sequence for only having communicating pair to share, and uses this channel characteristics sequence as secret
Information carries out key quantization and negotiates.Specific key quantization negotiations process is comprised the following steps that referring to Fig. 1
Step 1: the both sides of data communication acquire communication data information in advance: both sides establish a kind of with cross correlation first
Wireless channel, interacted within the set time, respectively obtain and send fixed duration according to fixed transmission rate and collected
Data packet, respectively extract the channel characteristic value in each data packet, respectively form a string for key quantization input numbers
According to.
In this example, by ping utility to STA and AP send data packet interact, transmission rate be set to 10 data packets/
Second, interaction duration is set to 200 seconds, respectively obtains the data packet of 1800 or so numbers, respectively extracts the RSS in each data packet
Value respectively forms a string of input datas for key quantization.
Step 2: both sides' initialization key quantization parameter of data communication: both sides are respectively to being used for obtained in the step 1
The input data of key quantization is segmented, and segment length is set as 100-300, and the datum mark of every section of initial packet is initialized as this section
Slope threshold value is arranged since 1 in first data point, every section of grouping serial number, and slope threshold value is set to 4 in this example, section
Length is set to 100.
Step 3: a side of data communication successively carries out Dynamic Packet slope quantization to every one piece of data after segmentation:
The bit quantization of 3.1 1 packet datas: a side of data communication chooses the first segment data, from the datum mark of this section
Start, data point later is successively compared with datum mark, if the absolute value of the difference of current data point and datum mark is big
When slope threshold value, then key quantization is carried out, generates a bit, and records the terminal that current data point is current group,
Current data point subscript is stored in grouping subscript record, grouping serial number increases by 1, and the datum mark of next grouping is upper one point
The terminal of group；Otherwise give up the data point, carry out the comparison of next data point, until terminating the grouping generates a bit；This
One process completes the bit quantization of a grouping.The Dynamic Packet method that the present invention uses can guarantee key generating rate compared with
Height, and when carrying out quantization bit generation, shadow will not be displaced by existing for the channel characteristic value that data communication both sides receive
It rings.
The packet bits of 3.2 one piece of data quantifies: a side of data communication will to the segment data successively according to step 3.1 into
Mobile state group quantization, a group quantization generate one and only one bit, the bit that each group quantization is generated
It is successively stored in quantization bit string, if quantization bit string is sky, a bit being currently generated as has quantified ratio
Spy's string；Otherwise a bit of generation is spliced to quantization bit string tail portion, this process completes the grouping of one piece of data
Bit quantization.
3.3 obtain key quantized result: a side of data communication carries out bit quantity according to step 3.2 to every one piece of data
Change, by each section obtained after quantization quantization bit string successively splice, obtain key quantization as a result, i.e. original quantisation is close
Key and grouping subscript record.
Referring to fig. 2, above-mentioned grouping process is described by taking the first grouping as an example, from datum mark (point that abscissa is 1)
Start, data point later is successively compared with the datum mark, under be designated as its RSS value of 2 data points be 26dB, the point value with
It is poor that benchmark point value 27dB makees, and difference is -1dB, absolute value 1dB, is less than slope threshold value 4, is generated without key, continues next
The comparison of point, when comparing to 4 data point, which is 32dB, difference 5dB, absolute value 5dB, is greater than slope threshold
Value 4 carries out key generation, and difference 5dB > 0, which is 1, and is saved it in quantization bit string, institute
Using a side of data communication by the data point subscript 4 as grouping subscript, and it is stored in grouping subscript record, while by the 4th
Datum mark of the point as next grouping.The bit quantization to the first grouping is just completed in this way.
Step 4: the both sides of data communication carry out cipher key agreement process with array is given up according to grouping subscript record, referring to figure
3, a side of data communication is Alice, another party Bob, specific negotiations process in this example are as follows:
Grouping subscript record in key quantized result is sent to another party by one side Alice of 4.1 data communications, i.e.,
Bob。
After another party Bob of 4.2 data communications receives the grouping subscript record of other side Alice, according to grouping subscript record
Key quantization is successively grouped to the input data for key quantization of oneself, it should if current group is without bit is generated
Grouping subscript, which is recorded in, to be given up in array；Otherwise the bit of generation is stored in quantization bit string, if quantization bit string
For sky, then a bit being currently generated is quantization bit string；Otherwise a bit of generation is spliced to and has quantified ratio
Spy string tail portion, after quantization another party Bob obtained key quantization as a result, i.e. quantization bit string with give up array, it is another
Square Bob will give up array and be sent to other side Alice, the quantization bit string quantization key final as another party Bob.
The other side Alice of 4.3 data communications receive another party Bob give up array after, according to give up array successively to from
Respective packets quantization bit in own original quantisation key is given up, and final quantization key is obtained, and completes both sides' key association
Quotient's process.
Step 5: the key quantization negotiations process of the both sides of data communication terminates, and both sides, which respectively obtain a string, has peace enough
01 bit key stream of overall length 128-256bit quantifies to realize encrypted wireless communication in the environment of arranging key herein.
In existing fixed packet key quantization machinery of consultation, key generating rate is low, and reason is communicating pair
Respective received channel characteristics data fluctuating range in fixed duration is smaller, causes significant figure strong point very few, generates key ratio
Special number is accordingly less；Key entropy generated is lower, has the sequence of continuous multiple 0 or continuous multiple 1 in key, reduces
Confidentiality；Seem very fragile for the channel attack of prediction, reason is if channel is periodically blocked, and channel is special
The reading of value indicative will increase or decrease.
The present invention is a kind of new method proposed on the basis of fixed packet key generation method, is to find a kind of move
State grouping extracts key rather than obtains the new way of key from fixed grouping.
The present invention proposes Dynamic Packet slope quantization method during key quantifies, due to one group of channel characteristic value sequence
Column are unlikely to be dull, and this avoid the situations for generating continuous 0 or continuous 1 key, have carried out some skills to original method
Art is improved, and is changed into Dynamic Packet from fixed grouping, is introduced fluctuation parameters and carry out threshold value quantizing, increases valid data points
Mesh, and by quantization method, mean quantization is changed to head and the tail two o'clock difference quantization in group out of organize, and operand reduces, thus further
Improve size of key generating rate.
Embodiment 2
Dynamic key quantization machinery of consultation based on radio physical layer channel characteristics is with embodiment 1, institute in step 1 of the present invention
The channel characteristic value used is received signal strength (RSS), and fixed transmission rate is generally set to 10 packets/seconds, when fixed
It is often 200 seconds, doing so can make communicating pair collect more channel characteristics data informations within the limited time, from
And the feature of channel is preferably embodied, guarantee the unpredictability of its key.
Transmission rate is 20 packets/seconds in this example, and Shi Changwei 200 seconds, 3500 or so can be collected by removing packet loss
A data packet, if transmission rate further increases, when more than 50 packets/seconds, packet loss will be increased substantially, and reach 30%
Left and right.
Embodiment 3
Slope of the dynamic key quantization machinery of consultation with embodiment 1-2, in step 2 based on radio physical layer channel characteristics
Threshold value is determined that the definition of slope threshold value (cmp) is cmp=elps/d, wherein parameter elps by parameter elps and fluctuation parameters d
It is defined as critical value, is the average value of difference between all consecutive number strong points in one piece of data, general value is 2-4, fluctuation parameters d
For reducing the influence that lesser fluctuation generates key, general value is 0.5-1.
Parameter elps is set as 2 in this example, and fluctuation parameters are set as 1, because both sides are static shape in this example test environment
State, both sides test in same room, therefore channel characteristics data fluctuations are smaller, and slope threshold value also can accordingly reduce.
Embodiment 4
Dynamic key quantization machinery of consultation based on radio physical layer channel characteristics is with embodiment 1-3, described in step 3.1
Each grouping when generating a bit, specifically, if the difference of current data point and datum mark is positive, the group quantization ratio
Specially for 1；If the difference of current data point and datum mark is negative, which is 0.
In this example, parameter elps is set as 4, and fluctuation parameters are set as 0.5, and slope threshold value is calculated as 4/0.5=8, because of this example
It tests in environment, it is stationary state that AP, which is in corridor, and STA is in a room by corridor, and is motion state, acquires
The channel characteristics data fluctuations arrived are larger, and will appear individual data point RSS value mutation phenomenon, so slope threshold value increases accordingly
To reduce the bit error rate of key generation.
Embodiment 5
Difference of the dynamic key quantization machinery of consultation with embodiment 1-4, in step 3.1 based on radio physical layer channel characteristics
Value Δ absolute value is defined as | Δ |=| array [i]-array [start] |, wherein array is input data column, and i is current number
Strong point subscript, start are current group datum mark.
In this example, slope quantization can be summarized as head and the tail difference quantization in group, quantify compared to mean value in organizing and a reference value,
Operand is small, this also illustrates that key generating rate of the invention is high from another angle.
Embodiment 6
Dynamic key quantization machinery of consultation based on radio physical layer channel characteristics is with embodiment 1-5, in step 4 of the present invention
Grouping information is recorded in grouping subscript record array, and grouping subscript array is denoted as segment, what each element therein saved
It is the terminal subscript of each grouping, segment [0] is first element of segment array, is saved in segment [0]
For the number of grouping；Give up array and be denoted as UB, wherein that the preservation of each element is each terminal subscript for giving up grouping, UB [0]
First element for giving up array for UB, saving in UB [0] is the number for giving up grouping.
Interaction data in the negotiations process of this example is only above-mentioned two array, and storage of array is under data point
Mark, rather than data point RSS value do so the safety that preferably ensure that RSS data, i.e., do not send any and RSS value outwardly
Related content can not therefrom recover quantization key even if listener-in's capture obtains the two arrays.
With another example, the present invention is further described below:
Embodiment 7
Dynamic key quantization machinery of consultation based on radio physical layer channel characteristics is with embodiment 1-6, referring to Fig. 1, communication
One side of both sides is Alice, another party Bob, and specific steps are described as follows:
Step1: at a fixed time in section communicating pair Alice and Bob by wireless communication link receive and dispatch mutually according to
Fixed transmission rate sends the collected data packet of fixed duration institute, and fixed transmission rate is 10 packets/seconds, a length of when fixed
300 seconds, both sides respectively extracted one group of channel characteristic value from the data packet of more than 2700 collected and save, and the present invention makes
It uses RSS as channel characteristic value, and records this group of data length and be denoted as Len.
The datum mark of step2:Alice and Bob initialisation packet parameter, first grouping is first data element,
Traversal starting point start is set and is initially the subscript of second element.
Step3: calculating slope a reference value cmp=elps/d, and wherein parameter elps is defined as critical value, and parameter d is used to subtract
The purpose of influence that few lesser fluctuation generates key, calculated slope threshold value is to come as the threshold value in quantizing process
Decide whether to quantify to generate a bit in current group；
Step4: beginning stepping through from the position start, when the position start exceed data element subscript maximum value, jump execution
step7；
Step5: when encountering the absolute value of difference DELTA of current point and datum mark greater than cmp, step6 is executed, otherwise more
New start makes it be directed toward the next element of data, returns and executes step4.
Step6: current group terminates, and grouping number increases by 1, records the terminal that current start is this grouping, will be grouped
Terminal subscript is saved in segment array, and updates the traversal starting point start' of next grouping.
If Δ > 0 step6.1, the quantization bit result queue of the grouping is 1；
If Δ < 0 step6.2, the quantization bit result queue of the grouping is 0；
In this example, the packet size of Dynamic Packet is determined by the sample data feature of the desired amount, such benefit
It is quantized result more close to the feature of data itself.When the difference of data point and datum mark meets threshold requirement
It is divided into a new grouping, can guarantee that quantized result formation efficiency reaches maximum in this way, i.e., key generating rate is maximum.
Step7: both sides start cipher key agreement process, and referring to Fig. 3, current grouping number is stored in segment by Alice
[0] position, grouped record array segment and quantized result quant array are saved later it is local, while by segment number
Group is sent to Bob, and Bob carries out quantization to RSS data group obtained in from step1 according to the segment array received and is recorded in
In quantization bit string, for it is not energetic go out bit grouped record in giving up array UB, after quantization, quantified ratio
Spy's string is final quantization key, and UB array is sent back to Alice by Bob.
After step 8:Alice receives UB array, ratio is quantified to the respective packets in oneself initial quantization key according to UB
Spy gives up, and Alice obtains final quantization key.
Due to not known before quantization for the RSS data feature under one group of special scenes, take it is fixed be grouped so that
Algorithm adaptability is poor, and the data point monotonicity being embodied in each fixed length grouping is not unique, so that slope is calculated
Method cannot play its maximum effect, cause key production quantity few, and key generating rate is low.If using Dynamic Packet of the invention
Slope algorithm will overcome this weakness, and the data point in each random length grouping is dull.The quality of quantized result only takes
Certainly in organize in slope absolute value whether be more than quantization threshold, in this way since, the generating rate of key increases substantially, the bit error rate
Also can relative reduction it is very much.
The present invention carries out will not be by the RSS value that communicating pair receives there are Influence of Displacement when quantization key generates, this
Point is better than existing section threshold value quantizing algorithm up and down.
A comprehensive more detailed example is given below, and the present invention is further described,
Embodiment 8
Dynamic key quantization machinery of consultation based on radio physical layer channel characteristics is tested with embodiment 1-7 referring to experiment
As a result table, i.e. table 1,
1 two kinds of existing quantization methods of table and this method quantify key length table under different experiments scene
According to the probe data packet received and dispatched between Bob and Alice, can be collected in section 200 seconds at a fixed time
One group of sufficiently long channel characteristics value sequence, by taking RSS value as an example.
Key is generated different from quantifying using upper and lower section fixed threshold, in Dynamic Packet slope quantization method of the present invention
In, a key bit is determined with the relative difference between two neighboring RSS value, with " quiet/dynamic 10pkg/s " this reality in table 1
It tests for describing and is illustrated, access point AP remains static, and wireless terminal STA is in moving condition, transmission rate 10
A packets/second, specific steps are as follows:
1) Alice and Bob respectively obtains a string of RSS cycle tests, test sequence Len=1523, and will test
Sequence is divided into m sections, m=15, every section t elements, and t=100, t are to be segmented segment length, and remaining 23 data points abandon；
2) it determines fluctuation parameters d, fluctuates the influence generated to key compared with small data for reducing, it is determined as 0.8；
3) critical value parameter elps is determined, it is determined as 3；
4) it determines slope threshold value cmp=elps/d, substitutes into data cmp=3/0.8=3.75；
5) key is extracted, during key of the present invention quantization, every segment data will be successively grouped by dynamic approach,
Every group at least there are two elements, and detailed process is as follows:
The starting elemental that every segment data first is grouped as an a reference value, successively by later data point and a reference value into
Row compares, if the absolute value of its difference is greater than cmp, then it is assumed that this data point meets as current group terminal and gives birth to grouping
At the condition of a bit, which is denoted as to the end element of this grouping, quantized result is stored in quantization bit string
In, while operation of the end element of the grouping by the starting elemental as next grouping, before continuing；And if this data
Point is unable to reach as current group terminal and makes the standard of grouping one bit of generation, then current data point subscript is expanded one
, it recalculates current data point and is grouped the absolute value of the difference of a reference value, determine whether current data point can become and divide
Group terminal simultaneously makes the grouping generate a bit, and so on.
The string of quantization bit that every section obtains successively is spliced, so far, the quantizing process of Alice key terminates,
Alice generates the initial quantization key of oneself, and obtains grouping subscript record array segment.
Following both sides will carry out key agreement, and the specific method is as follows: segment array is sent to Bob by Alice,
Bob sends segment array by Alice and carries out key quantization, determines ratio that is grouping but oneself not can determine that grouping to Alice
Whether spy recalculates, can be matched using the trial of smaller elps value, so that key production rate is improved, if still can not match
Then the grouping subscript is recorded in and is given up in array UB；
Then UB array is issued Alice by Bob, and Alice is adjusted again, according to UB by the initial quantization key of oneself
Partial bit give up；
Finally, Alice and Bob have obtained respective last quantization key, length 264bit completes entire quantization association
Quotient's process.
The novel dynamic key quantization based on radio physical layer channel characteristics cross correlation that the present invention designs and Implements
Machinery of consultation, using Dynamic Packet slope quantized channel characteristic value go forward side by side row information coordinate, finally obtain a string of safe enoughs
Key stream, efficiency can ensure the generation 128-256bit key stream in 200 seconds or so durations, improve the generation speed of key stream
Rate, while ensure that the random entropy of key stream is higher, better than traditional threshold value quantizing algorithm of section up and down, also superior to fixed point
Group slope quantization algorithm.
In brief, the invention discloses a kind of, and the dynamic key based on radio physical layer channel characteristics quantifies negotiation side
Method, it is low to solve existing quantization negotiation algorithm key generating rate, the lower problem of entropy.Quantifying negotiations process includes: data
The both sides of communication acquire communication data information in advance, and parameter is negotiated in initialization key quantization, after a side of data communication is to segmentation
Every one piece of data successively carry out Dynamic Packet slope and quantify to obtain initial key, the both sides of data communication are according to the lower label of grouping
It records array and gives up array and key agreement is carried out to initial key, final both sides respectively obtain final key.The present invention improves
The generating rate of key stream, while ensure that the entropy of key stream is higher, communicating pair can generate in duration at 200 seconds or so
128-256bit key stream.
The present invention is applied to wireless network coded communication, is specifically used for key and generates negotiation, obtained key can be used as adding
Encryption key in close communication realizes safety communication.
Claims (5)
1. a kind of dynamic key based on radio physical layer channel characteristics quantifies machinery of consultation, which is characterized in that include as follows
Step:
Step 1: the both sides of data communication acquire communication data information in advance: both sides establish a kind of nothing with cross correlation first
Line channel, interacts within the set time, respectively obtains and sends the collected number of fixed duration institute according to fixed transmission rate
According to packet, the channel characteristic value in each data packet is respectively extracted, respectively forms a string of input datas for key quantization；
Step 2: both sides' initialization key quantization parameter of data communication: both sides respectively to the input data quantified for key into
Row segmentation, the datum mark of every section of initial packet are initialized as first data point of this section, and every section of grouping serial number is opened from 1
Begin, and slope threshold value is set；
Step 3: a side of data communication successively carries out Dynamic Packet slope quantization to every one piece of data after segmentation:
One side of 3.1 data communications chooses the first segment data, since the datum mark of this section, by data point later successively with
Datum mark is compared, if the absolute value of the difference of current data point and datum mark is greater than slope threshold value, carries out size of key
Change, generate a bit, and record the terminal that current data point is current group, data point subscript is stored in grouping subscript
In record, grouping serial number increases by 1, and the datum mark of next grouping is the terminal of a upper grouping；Otherwise give up the data point, carry out
The comparison of next data point, until terminating the grouping generates a bit；This process completes the bit quantization of a grouping；
One side of 3.2 data communications successively will carry out Dynamic Packet quantization, an amount of packets according to step 3.1 to the segment data
At one and only one bit, the bit that each group quantization is generated successively is stored in quantization bit string metaplasia,
If quantization bit string is sky, a bit being currently generated is quantization bit string；Otherwise by a bit of generation
It is spliced to quantization bit string tail portion, this process completes the packet bit quantization of one piece of data；
One side of 3.3 data communications carries out bit quantization according to step 3.2 to every one piece of data, each by what is obtained after quantization
Section quantization bit string successively carry out splicing generate original quantisation key, obtain key quantization as a result, i.e. original quantisation key and
It is grouped subscript record；
Step 4: the both sides of data communication carry out cipher key agreement process with array is given up according to grouping subscript record, specifically negotiate
Journey includes:
Grouping subscript record in key quantized result is sent to another party by one side of 4.1 data communications；
After another party of 4.2 data communications receives the grouping subscript record of other side, oneself is used for according to grouping subscript record
The input data of key quantization is successively grouped key quantization, records the grouping subscript if current group is without bit is generated
In giving up array；Otherwise the bit of generation is stored in quantization bit string, if quantization bit string is sky, works as previous existence
At a bit be quantization bit string；Otherwise a bit of generation is spliced to quantization bit string tail portion, quantified
After another party obtained key quantization as a result, quantization bit string and having given up array, another party will give up array and send
To other side, the quantization bit string quantization key final as another party；
The other side of 4.3 data communications receive another party give up array after, it is successively close to oneself original quantisation according to array is given up
Respective packets quantization bit in key is given up, and final quantization key is obtained, and completes both sides' cipher key agreement process；
Step 5: the key quantization negotiations process of the both sides of data communication terminates, and both sides, which respectively obtain a string, has safe enough long
01 bit key stream of 128-256bit is spent, quantifies to realize wireless secret communication in the environment of arranging key herein.
2. a kind of dynamic key based on radio physical layer channel characteristics according to claim 1 quantifies machinery of consultation,
It is characterized in that, the slope threshold value in step 2 is determined by parameter elps and fluctuation parameters d, and the definition of slope threshold value (cmp) is
Cmp=elps/d, wherein parameter elps is defined as critical value, and difference is averaged between all consecutive number strong points in one piece of data
Value, value 2-4, fluctuation parameters d are used to reduce the lesser influence fluctuated and generated to key, value 0.5-1.
3. a kind of dynamic key based on radio physical layer channel characteristics according to claim 1 quantifies machinery of consultation,
It is characterized in that, when one bit of generation described in step 3.1, specifically, if the difference of current data point and datum mark is positive,
Then the group quantization bit is 1；If the difference of current data point and datum mark is negative, which is 0.
4. a kind of dynamic key based on radio physical layer channel characteristics according to claim 1 quantifies machinery of consultation,
It is characterized in that, the absolute value of the difference DELTA of current data point described in step 3 and datum mark is defined as | Δ |=| array
[i]-array [start] |, wherein array is input data column, and i is current data point subscript, and start is current group benchmark
Point.
5. a kind of dynamic key based on radio physical layer channel characteristics according to claim 1 quantifies machinery of consultation,
It is characterized in that in step 4 that grouping information is recorded in grouping subscript record array segment, what each element therein saved is
The terminal subscript of each grouping, preservation is the number of grouping in segment [0]；Give up each element in array UB to save
Be each terminal subscript for giving up grouping, saving in the UB [0] is the number for giving up grouping.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710905539.5A CN107528687B (en) | 2017-09-29 | 2017-09-29 | Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710905539.5A CN107528687B (en) | 2017-09-29 | 2017-09-29 | Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107528687A CN107528687A (en) | 2017-12-29 |
| CN107528687B true CN107528687B (en) | 2019-08-13 |
Family
ID=60736369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710905539.5A Active CN107528687B (en) | 2017-09-29 | 2017-09-29 | Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107528687B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108696867B (en) * | 2018-05-25 | 2021-04-20 | 南京东科优信网络安全技术研究院有限公司 | Lightweight group key distribution method based on wireless channel characteristics |
| CN109495167B (en) * | 2018-10-26 | 2020-06-19 | 北京邮电大学 | Client and consistent key negotiation method based on bit error rate |
| CN111200817B (en) * | 2020-01-07 | 2022-07-19 | 湖南大学 | Method for automatically negotiating secret key between wireless devices |
| CN111565090B (en) * | 2020-04-13 | 2021-06-11 | 西北工业大学 | Method for enhancing physical layer information reciprocity |
| CN111800416B (en) * | 2020-07-03 | 2021-07-27 | 西南大学 | Cryptographic protocol analysis method based on non-monotonicity dynamic cognitive logic |
| CN114448611A (en) * | 2020-11-02 | 2022-05-06 | 中兴通讯股份有限公司 | Key generation method and device, electronic equipment and storage medium |
| CN113194466A (en) * | 2021-04-23 | 2021-07-30 | 哈尔滨理工大学 | Hybrid key system and method based on wireless channel characteristic simulation |
| CN113473460B (en) * | 2021-06-07 | 2022-07-01 | 西安电子科技大学 | Wireless physical layer key negotiation method based on error correcting code judgment |
| CN113746624B (en) * | 2021-09-04 | 2022-06-17 | 中国人民解放军国防科技大学 | Physical layer security key extraction method based on fuzzy extractor negotiation |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104811299B (en) * | 2015-04-03 | 2018-04-10 | 北京邮电大学 | Key generation method and device |
| CN104901795B (en) * | 2015-05-12 | 2018-12-11 | 南京邮电大学 | Physical layer key extraction method based on channel characteristics |
| CN105120453A (en) * | 2015-07-15 | 2015-12-02 | 中国科学院信息工程研究所 | Secret key generation method |
| CN105515765B (en) * | 2015-12-09 | 2018-08-10 | 西安电子科技大学 | The biological secret key generation method of adaptive dynamic quantization |
| CN106059758B (en) * | 2016-07-08 | 2019-03-05 | 大连理工大学 | A kind of key generation method ensuring secure wireless communication |
| CN107124716B (en) * | 2017-06-05 | 2019-07-12 | 东南大学 | Wireless channel dynamic key production method based on fixed position |
-
2017
- 2017-09-29 CN CN201710905539.5A patent/CN107528687B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107528687A (en) | 2017-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107528687B (en) | Dynamic key based on physical layer channel cross correlation quantifies machinery of consultation | |
| Ren et al. | Accelerating DNN training in wireless federated edge learning systems | |
| Uthayakumar et al. | Highly reliable and low-complexity image compression scheme using neighborhood correlation sequence algorithm in WSN | |
| Chen et al. | Cognitive information measurements: A new perspective | |
| CN109688596B (en) | NOMA-based mobile edge computing system construction method | |
| CN104640110B (en) | A kind of Symmetric key generation method based on the characteristic of channel in terminal direct connection communication | |
| CN107360568B (en) | Method for realizing symmetric encryption and guaranteeing wireless data secure transmission by utilizing fountain codes | |
| US11082841B2 (en) | Secure physical layer slope authentication method in wireless communications and apparatus | |
| Li et al. | Mobility-aware offloading and resource allocation in NOMA-MEC systems via DC | |
| CN106899524B (en) | Safety access method based on channel estimating and user QoS | |
| CN111917527A (en) | Industrial internet covert communication system based on 5G NR carrier aggregation and communication method thereof | |
| Jiang et al. | Compressed sensing with dynamic retransmission algorithm in lossy wireless IoT | |
| Elgendy et al. | Security-aware data offloading and resource allocation for MEC systems: a deep reinforcement learning | |
| CN109561129B (en) | Cooperative computing unloading method based on optical fiber-wireless network | |
| EP2070376A2 (en) | Techniques for key derivation for secure communication in wireless mesh networks | |
| Saki et al. | Machine learning based frame classification for videos transmitted over mobile networks | |
| WO2019061515A1 (en) | Robust wireless communication physical layer slope authentication method and device | |
| CN111200813B (en) | Large-scale MIMO system maximized minimum user safety energy efficiency optimization method based on SWIPT | |
| Zhou et al. | Joint computation offloading and resource allocation for NOMA-enabled industrial Internet of things | |
| Lin et al. | Channel-adaptive quantization for wireless federated learning | |
| Li et al. | High entropy secrecy generation from wireless CIR | |
| CN104811306B (en) | Method for authenticating entities, apparatus and system | |
| Liu et al. | Adaptive Cluster Head Selection and Spectrum Allocation for D2D-Enabled Collaborative Learning | |
| CN114430550B (en) | Wireless physical layer key generation method based on neural network model | |
| CN115002757B (en) | Edge cooperative data encryption transmission method based on IEEE802.11ah |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |