CN106130725A - The measuring method of quantum key distribution network end-to-end bottleneck secret-key rate - Google Patents
The measuring method of quantum key distribution network end-to-end bottleneck secret-key rate Download PDFInfo
- Publication number
- CN106130725A CN106130725A CN201610742049.3A CN201610742049A CN106130725A CN 106130725 A CN106130725 A CN 106130725A CN 201610742049 A CN201610742049 A CN 201610742049A CN 106130725 A CN106130725 A CN 106130725A
- Authority
- CN
- China
- Prior art keywords
- packet
- secret
- key
- bag
- length
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 8
- 238000012360 testing method Methods 0.000 claims abstract description 47
- 238000005259 measurement Methods 0.000 claims abstract description 9
- 102100029469 WD repeat and HMG-box DNA-binding protein 1 Human genes 0.000 claims description 2
- 101710097421 WD repeat and HMG-box DNA-binding protein 1 Proteins 0.000 claims description 2
- 238000005457 optimization Methods 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010998 test method Methods 0.000 description 1
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/0852—Quantum cryptography
- H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
-
- 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/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the method for testing of a kind of quantum key distribution network end-to-end bottleneck secret-key rate, mainly solving the maldistribution of resources problem caused in prior art because bottleneck link secret-key rate is unknown, implementation step is: 1) arrange test long data packet；2) test path source and destination are set；3) source send N number of be spaced apart 0 isometric packet；4) receive packet at destination and add up the arrival interval between adjacent data bag；5) data packet length is selected to re-start measurement according to arrival interval between adjacent data bag；6) according to measuring the long computation key speed of bag used；7) secret-key rate recording difference bag length is averaged and is obtained final secret-key rate.The present invention can not only the secret-key rate of end-to-end bottleneck link in measured amount quantum key distribution network, and improve certainty of measurement by the selection of packet bag length, can be used for the performance optimization for quantum key distribution network provides foundation.
Description
Technical field
The invention belongs to communication technical field, particularly to a kind of measuring method measuring end-to-end bottleneck secret-key rate,
Can be used for the performance optimization for quantum key distribution network and foundation is provided.
Background technology
Quantum communications originate from the requirement to communication security, and people pay much attention to for communication security since ancient times.And it is right
Information is encrypted one of important method being to ensure that information communication security.Based on quantum-mechanical Heisenberg's uncertainty principle
Theorem unclonable with quantum state, quantum key distribution technology sets up shared key between the two parties, by one-time pad
Encryption policy, it is achieved be perfectly safe communication.Therefore, quantum key distribution network based on quantum key distribution QKD technology meets the tendency
And give birth to.In quantum communication system, communicating pair has classical secret signalling and quantum key distribution system, and QKD system is used
Produce key, as the key of classical secret signalling, be therefore the important component part of quantum key distribution network.By
In the restriction of prior art, the speed of QKD system arranging key is relatively low, therefore conjunction to key in quantum key distribution network
Reason utilizes most important.
In quantum key distribution network, key uses strategy to have End to End Encryption and hop-by-hop encryption two ways.
End to End Encryption mode is to be encrypted at communicating pair, decipher, and need not decipher at middle repeater again
Encryption, only encrypts in source, deciphers in receiving end, i.e. can only obtain ciphertext at repeater, and cannot decipher.At the beginning of this strategy has
The time delay that beginning is accessed, need to determine the key length of negotiation every time, and negotiation time lags behind the end of conversation time.
For the mode of hop-by-hop encryption, quantum cryptography packet arrives repeater and is first decrypted, and recovers raw information,
Before being transmitted to down hop, for preventing from divulging a secret, new key can be utilized to encrypt again, issue next credible relaying, credible in
Continue and may proceed to deciphering and re-encrypt, be finally decrypted in receiving end, obtain raw information.
End to End Encryption mode, needs to be initially formed end-to-end key, the doubling of traffic of classic network；And hop-by-hop encryption, it is
Directly utilizing cipher key pair information encryption and decryption, the flow of classic network is constant, and hop-by-hop encryption is also without key is determined in advance
The length of block and total length.The cipher mode of discussion of the present invention is hop-by-hop encryption mode.
In quantum key distribution network, for the hop-by-hop encryption mode of one-time pad, from communication source to destination, often
Through a link, will consume key, if the speed of data is much larger than secret-key rate, then key is not enough, causes a part
Data can not be encrypted in time, if continuing waiting for key, is then likely to result in network congestion, if the most directly encrypting, then and these part data
Will reveal, cause safety problem, and quantum key distribution network is higher to security requirement, if so key is not enough,
Then network performance will reduce.If the transmission rate of data is much smaller than secret-key rate, then key can not fully be used, and has
Time in order to ensure the freshness of key, a part of key can be dropped.Understood no matter packet rate is more than close by above analysis
Key speed is also less than secret-key rate, and network all can not be in the state of optimum, it is therefore desirable to estimates secret-key rate.?
In the case of end-to-end bottleneck secret-key rate the unknown, if portfolio is more than the key of bottleneck, then there will be because key is not enough
The safety problem caused, it is impossible to Appropriate application Internet resources.
Summary of the invention:
It is an object of the invention to for above deficiency, propose a kind of quantum key distribution network end-to-end bottleneck key speed
The measuring method of rate, to obtain bottleneck secret-key rate, can be used for as reasonable distribution Internet resources, and optimizing network performance provides and depend on
According to.
For achieving the above object, technical scheme includes the following:
(1) arranging test packet, a length of L of this test packet takes 256 bytes；
(2) two ends in path to be tested are divided into source and destination, test packet is placed in source；
(3) source send N number of be spaced apart 0 isometric packet；
(4) destination receives the test packet that source sends, and adds up in order between the arrival between adjacent data bag
Every, if the data of statistics are less than N-1, then return step (3) and re-start test；If the data counted are N-1, then sentence
The disconnected length now testing packet, if 256 bytes, then performs step (5), otherwise, performs step (6)；
(5) according to the arrival interval of statistical data, determine the data package size used by follow-up measurement, and measure:
If the ratio of the arrival interval of the adjacent data bag counted on is less than or equal to 2, then change the length of packet, respectively
Take the long L of bag1j=1450-10j, j=0,1 ... 5, repeat step (3)-(4) and measure；
If the ratio of the arrival interval of the adjacent data bag counted on is more than 2, then changes the length of packet, take bag respectively long
L2j=45-5j, repeats step (3)-(4) and measures；
(6) according to bag is long, the data recorded are processed:
If wrapping a length of L1j, then the arrival interval Δ τ of packet is recordedi, first calculate N-1 secret-key rate valuei
=1,2 ... N-1, then this N-1 secret-key rate value is averaged calculate bag a length of L1jTime the secret-key rate that records
If wrapping a length of L2j, then the arrival interval Δ τ of two groups of packets is recordedk, k=1,2 ... M, wherein Δ τkFor when previous
The due in of last packet and the difference of the due in of first packet in next group packet in group packet,
Packet number n between record kth arrival interval and-1 arrival interval of kthk, first calculate M secret-key rate valueAgain this M secret-key rate value is averaged and calculate a length of L of bag2jTime the secret-key rate that records
(7) the secret-key rate r that difference bag length is recordedjAsk for average, it is thus achieved that the secret-key rate of bottleneck link
Present invention have the advantage that
1, due to the fact that the relation of bottleneck secret-key rate and packet arrival interval of being deduced, therefore can be according to recording
Packet arrival interval calculates the secret-key rate of bottleneck link, it is to avoid prior art carries because bottleneck secret-key rate is unknown
The maldistribution of resources problem come, can be used for the performance optimization for quantum key distribution network provides foundation.
2, the present invention is when test owing to first sending one group of test packet, changes data further according to the data characteristics recorded
Test after packet length, improve the certainty of measurement of secret-key rate.
Accompanying drawing illustrates:
Fig. 1 is the test flow chart of the present invention.
Detailed description of the invention
Below in conjunction with accompanying drawing, the present invention is described in further detail.
One, test scene introduction:
This method of testing is for quantum key distribution QKD network, and this QKD network is by credible relaying and quantum key distribution chain
Road is constituted.By QKD link establishment link key between credible relaying, the on-demand application of key of each link negotiation, but not can
Storing at letter relaying, the end-to-end communication key between two users can be transmitted by link key hop-by-hop and set up.If i-th chain
The secret-key rate that road can provide is RiBit/s, key updating is spaced apart τ, and the size of key every time updated is NiBit, then key
Speed and the relation updated between interval and renewal size of key are Ni=Riτ。
For the cipher mode of packet, after packet arrives credible relaying, packet being stored in list, packet waits
Key updating, QKD is constantly in the state of work, checks in list whether there is packet when key updating, if existing,
Key is updated, when the size of key updated is more than or equal to the length of packet by Data Packet Encryption after forward.Due to reality
The classical channel width of link key speed link to be much smaller than between credible relaying in middle quantum key distribution network, therefore
In quantum key distribution network, the attention rate of secret-key rate is higher than bandwidth.The present invention is exactly to quantum key distribution network
In end to end bottleneck secret-key rate measure.
Two, test philosophy:
Measurement to end-to-end bottleneck secret-key rate, is to send nonseptate isometric data by test path one end
Bag, receives what test packet realized at the other end.At bottleneck link, if the size of key updated is less than the length of packet every time
Degree, the size of key the most repeatedly updated can send a packet, makes the arrival interval between two packets be approximately equal to
Update the time of size of key needed for a packet, therefore can be according to bag is long and arrival interval just can calculate secret-key rate.If it is every
The size of key of secondary renewal enough sends several packet more than the length of packet, the then size of key updated every time, referred to as may be used
To send one group of packet, the arrival interval between two groups of packets is made to be approximately equal to update size of key needed for one group of packet
Time, therefore just can calculate secret-key rate according to total Bao Changyu arrival interval of one group of packet.
If the length of packet is more than the size of key updated every time, then the size of key of m update cycle renewal is needed just may be used
To send a packet, at this time the bag of packet is long really individual more between size of key and the m of m-1 update cycle renewal
Between the size of key that the new cycle updates, when the value of m is the biggest, the value of m-1/m is closer to 1, and the estimation to size of key is the most accurate,
At this moment the bag length that can be approximately considered packet is exactly the size of key updated m update cycle.
If the length of packet is sent out less than the size of key updated, then enough n the packets of size of key updated every time every time
Sending, the size of key at this time updated is really and wraps between length between the always bag length of n packet and the total of n+1 packet,
When the value of n is the biggest, the value of n/n+1 is closer to 1, and the estimation to size of key is the most accurate, at this moment can be approximately considered n packet
Total bag length is exactly the size of key updated a update cycle.
Three, implementation
With reference to Fig. 1, the present invention is implemented as follows:
Step 1, arranges test long data packet.
The present invention utilizes the arrival interval between the Bao Changyu packet of packet to obtain secret-key rate, it is therefore desirable to right
Packet bag length is configured, and i.e. arranging test data packet length L is 256 bytes.
Step 2, arranges test path source and destination.
Needing test path during test, the two ends in path to be tested are divided into source and destination, and source by the present invention
For sending test packet, destination is used for receiving test packet.
Step 3, sends test packet.
Test packet is placed in source, and send N number of be spaced apart 0 isometric packet.
Step 4, receives test packet.
The test packet that destination reception source sends, and record the due in of packet, adjacent two data bag
The arrival interval that is between packet of the difference of due in；
Arrival interval between statistics adjacent data bag in order, source have sent N number of test packet, then receiving terminal should
Count on N-1 arrival interval, if the data of statistics are less than N-1, illustrate that now offered load is relatively big, the error in data obtained
Bigger, it is therefore desirable to return step 3 and re-start test.If the data counted are N-1, then judge now to test packet
Length, if 256 bytes, then perform step 5, otherwise, perform step 6.
Step 5, test data analysis also remeasures.
Arrival interval according to step 4 statistical data, it is judged that the size of key that bottleneck link updates every time and test data
The relation of packet length, and then determine the data package size used by follow-up measurement, and measure according to data packet length:
If the ratio of the arrival interval of the adjacent data bag counted on is less than or equal to 2, illustrate that now bottleneck link is the most more
New size of key is less than or is equal to the length of test packet, in order to improve the certainty of measurement of secret-key rate, needs to increase number
According to the length of bag, therefore take the long L of bag1j=1450-10j, j=0,1 ... 5, repeat step (3)-(4) and survey difference bag length
Amount；
If the ratio of the arrival interval of the adjacent data bag counted on more than 2, to illustrate that now bottleneck link updates every time close
Key amount is more than the length of test packet, and the size of key the most once updated can send one group of packet, in order to improve key speed
The certainty of measurement of rate, needs to reduce the length of packet, therefore takes the long L of bag2j=45-5j, repeats step (3)-(4) to difference bag
Length measures.
The data recorded are processed by step 6 according to bag is long.
Owing to step 5 is the test carried out according to difference bag length, therefore it is also required to according to the difference bag length data to recording
Process:
If the data packet length used by Ce Shi is L1j=1450-10j, then illustrate that needs carry out repeatedly key updating and encrypt
Send test packet, the now arrival interval of adjacent data bag time used by the most more new key, test packet
The a length of size of key repeatedly updated, then calculate close according to the arrival interval of the test length of packet and adjacent data bag
Key speed, the most first calculates N-1 secret-key rate valueAveraging this N-1 secret-key rate value, it is long to calculate bag again
For L1jTime the secret-key rate that recordsWherein i=1,2 ... N-1, L1jFor testing the length of packet, Δ τiFor record
The arrival interval of adjacent data bag；
If the data packet length used by Ce Shi is L2j=45-5j, then the size of key that explanation updates every time can encrypt transmission
One group of packet, length and arrival interval according to one group of packet just can calculate secret-key rate, it may be assumed that
First calculate M secret-key rate valueK=1,2 ... M, wherein L2jFor testing the length of packet, Δ τk
For the arrival interval between the two adjacent groups packet of record, it is defined as when last packet in previous group packet
Due in and the difference of the due in of first packet, n in next group packetkFor record kth arrival interval with
Packet number between-1 arrival interval of kth；
Again this M secret-key rate value is asked for mean value computation to go out to wrap a length of L2jTime the secret-key rate that records
Changing the value of j, the data recorded difference bag length respectively calculate.
Step 7, calculates final secret-key rate.
The secret-key rate r that difference bag length is recordedjAsk for average, it is thus achieved that the secret-key rate of bottleneck link
Above description is only example of the present invention, it is clear that for those skilled in the art, is understanding
After present invention and principle, all may carry out in form and details in the case of without departing substantially from the principle of the invention, structure
Various corrections and change, but these corrections based on inventive concept and change are still at the claims of the present invention
Within.
Claims (1)
1. quantum key distribution network end-to-end bottleneck secret-key rate measuring method, comprises the following steps:
(1) arranging test packet, a length of L of this test packet takes 256 bytes；
(2) two ends in path to be tested are divided into source and destination, test packet is placed in source；
(3) source send N number of be spaced apart 0 isometric packet；
(4) destination receives the test packet that source sends, and adds up the arrival interval between adjacent data bag in order, if
The data of statistics less than N-1, then return step (3) and re-start test；If the data counted are N-1, then judge this
Time test packet length, if 256 bytes, then perform step (5), otherwise, perform step (6)；
(5) according to the arrival interval of statistical data, determine the data package size used by follow-up measurement, and measure:
If the ratio of the arrival interval of the adjacent data bag counted on is less than or equal to 2, then changes the length of packet, take bag respectively
Long L1j=1450-10j, j=0,1 ... 5, repeat step (3)-(4) and measure；
If the ratio of the arrival interval of the adjacent data bag counted on is more than 2, then change the length of packet, take the long L of bag respectively2j=
45-5j, repeats step (3)-(4) and measures；
(6) according to bag is long, the data recorded are processed:
If wrapping a length of L1j, then the arrival interval Δ τ of packet is recordedi, first calculate N-1 secret-key rate valueI=1,
2 ... N-1, then this N-1 secret-key rate value is averaged calculate bag a length of L1jTime the secret-key rate that records
If wrapping a length of L2j, then the arrival interval Δ τ of two groups of packets is recordedk, k=1,2 ... M, wherein Δ τkFor when previous group data
The due in of last packet and the difference of due in of first packet in next group packet in bag, record the
Packet number n between k arrival interval and-1 arrival interval of kthk, first calculate M secret-key rate valueAgain
This M secret-key rate value is averaged and calculates a length of L of bag2jTime the secret-key rate that records
(7) the secret-key rate r that difference bag length is recordedjAsk for average, it is thus achieved that the secret-key rate of bottleneck link
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610742049.3A CN106130725B (en) | 2016-08-26 | 2016-08-26 | The measurement method of quantum key distribution network end-to-end bottleneck secret-key rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610742049.3A CN106130725B (en) | 2016-08-26 | 2016-08-26 | The measurement method of quantum key distribution network end-to-end bottleneck secret-key rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106130725A true CN106130725A (en) | 2016-11-16 |
| CN106130725B CN106130725B (en) | 2019-04-23 |
Family
ID=57271888
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610742049.3A Active CN106130725B (en) | 2016-08-26 | 2016-08-26 | The measurement method of quantum key distribution network end-to-end bottleneck secret-key rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106130725B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108683495A (en) * | 2018-04-17 | 2018-10-19 | 全球能源互联网研究院有限公司 | The test method and system of quantum-key distribution equipment safety key performance indicator |
| CN108964907A (en) * | 2018-08-06 | 2018-12-07 | 广东石油化工学院 | A kind of quantum-key distribution equipment determines method and system at code rate |
| CN114500337A (en) * | 2022-01-24 | 2022-05-13 | 西安电子科技大学 | End-to-end available key rate measuring method for quantum metropolitan area network based on machine learning |
| CN114598462A (en) * | 2022-02-28 | 2022-06-07 | 西安电子科技大学 | End-to-end key generation method based on dynamic adjustment in quantum metropolitan area network |
| WO2022142307A1 (en) * | 2020-12-31 | 2022-07-07 | 清华大学 | Secure relay-based quantum communication method and communication network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814988A (en) * | 2010-02-04 | 2010-08-25 | 安徽量子通信技术有限公司 | Two-way quantum key generating and receiving device and generating and receiving method thereof |
| US20150193306A1 (en) * | 2014-01-08 | 2015-07-09 | Kabushiki Kaisha Toshiba | Quantum communication device, quantum communication method, and computer program product |
-
2016
- 2016-08-26 CN CN201610742049.3A patent/CN106130725B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814988A (en) * | 2010-02-04 | 2010-08-25 | 安徽量子通信技术有限公司 | Two-way quantum key generating and receiving device and generating and receiving method thereof |
| US20150193306A1 (en) * | 2014-01-08 | 2015-07-09 | Kabushiki Kaisha Toshiba | Quantum communication device, quantum communication method, and computer program product |
Non-Patent Citations (2)
| Title |
|---|
| BINGJIE XU等: "THE SECYRITY OF SARG04 PROTOCOL IN PLUG AND PLAY QKD SYSTEM WITH AN UNTRUSTED SOURCE", 《QUANTUM INFORMATION AND COMPUTATION》 * |
| 朱畅华: "IP网络测量和业务性能研究", 《中国优秀博硕士学位论文全文数据库 (博士) 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108683495A (en) * | 2018-04-17 | 2018-10-19 | 全球能源互联网研究院有限公司 | The test method and system of quantum-key distribution equipment safety key performance indicator |
| CN108964907A (en) * | 2018-08-06 | 2018-12-07 | 广东石油化工学院 | A kind of quantum-key distribution equipment determines method and system at code rate |
| WO2022142307A1 (en) * | 2020-12-31 | 2022-07-07 | 清华大学 | Secure relay-based quantum communication method and communication network |
| CN114500337A (en) * | 2022-01-24 | 2022-05-13 | 西安电子科技大学 | End-to-end available key rate measuring method for quantum metropolitan area network based on machine learning |
| CN114598462A (en) * | 2022-02-28 | 2022-06-07 | 西安电子科技大学 | End-to-end key generation method based on dynamic adjustment in quantum metropolitan area network |
| CN114598462B (en) * | 2022-02-28 | 2023-10-17 | 西安电子科技大学 | Dynamic adjustment-based end-to-end key generation method in quantum metropolitan area network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106130725B (en) | 2019-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106130725B (en) | The measurement method of quantum key distribution network end-to-end bottleneck secret-key rate | |
| CN106330434B (en) | First quantum node, second quantum node, secure communication architecture system and method | |
| KR100838556B1 (en) | Efficient transmission of cryptographic information in secure real time protocol | |
| US8964989B2 (en) | Method for adding nodes to a quantum key distribution system | |
| JP7353375B2 (en) | End-to-end double ratchet encryption with epoch key exchange | |
| TW201633742A (en) | Quantum key distribution system, method and apparatus based on trusted relay | |
| CN101471769B (en) | Enciphering/deciphering method for VoIP medium transmission | |
| JP2008533910A (en) | How to integrate QKD with IPSec | |
| CN101939955A (en) | Method and system for controlling link saturation of synchronous data across packet networks | |
| Zibideh et al. | Modified-DES encryption algorithm with improved BER performance in wireless communication | |
| JP2013030890A (en) | Communication device and communication method | |
| WO2022161369A1 (en) | Security management information processing method and apparatus for optical transport network | |
| CN111464303A (en) | Secure time transmission method and system based on bidirectional quantum key distribution | |
| CN108390799A (en) | The measurement method of quantum key distribution network end-to-end available key rate | |
| Stan et al. | Securing communication with quantum key distribution: Implications and impact on network performance | |
| CN104158788A (en) | Method of end-to-end data transmission | |
| Matalgah et al. | Simple encryption algorithm with improved performance in wireless communications | |
| CN101232519A (en) | Wireless IP network variable area communicating method based on IPSec protocol | |
| CN104579645A (en) | Secret key updating method based on AES encryption system | |
| KR20030088643A (en) | Method of encryption for gigabit ethernet passive optical network | |
| CN115361129A (en) | Quantum key secure distribution method and system based on Internet of things | |
| KR102631694B1 (en) | System and Method for encryption/decription and channel-coding | |
| CN114401085A (en) | Network architecture of quantum secret communication network and key storage method | |
| CN107342853B (en) | Counter synchronization method with low interaction overhead | |
| Matsuzono et al. | QKDN meets ICN: Efficient Secure In-Network Data Acquisition |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| OL01 | Intention to license declared | ||
| OL01 | Intention to license declared |