CN103944712B - Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence - Google Patents

Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence Download PDF

Info

Publication number
CN103944712B
CN103944712B CN201410209188.0A CN201410209188A CN103944712B CN 103944712 B CN103944712 B CN 103944712B CN 201410209188 A CN201410209188 A CN 201410209188A CN 103944712 B CN103944712 B CN 103944712B
Authority
CN
China
Prior art keywords
sequence
control code
code sequence
alice
generating
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.)
Expired - Fee Related
Application number
CN201410209188.0A
Other languages
Chinese (zh)
Other versions
CN103944712A (en
Inventor
曹正文
彭进业
曾贵华
邓雨晨
刘佳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northwest University
Original Assignee
Northwest University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northwest University filed Critical Northwest University
Priority to CN201410209188.0A priority Critical patent/CN103944712B/en
Publication of CN103944712A publication Critical patent/CN103944712A/en
Application granted granted Critical
Publication of CN103944712B publication Critical patent/CN103944712B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for generating an MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence. The method comprises the steps: step 1, a distributing and negotiating stage; step 2, the generation of an initial secret key sequence: feeding an initial value X0 and a parameter value [mu] into a chaotic system through an Alice, iterating for N times to obtain N real numbers, selecting N real numbers including X1a, X2a, ..., Xna from the chaotic system, and respectively performing binarization processing on the X1a, X2a, ..., Xna, and generating a binary initial secret key sequence S0a; step 3, generating a check code sequence and a control code sequence; step 4, transmitting and approving the check code sequence; and step 5, displacing the control code sequence to circularly generate a process of discharging codons. According to the method, the initial secret key sequence is randomly generated by the extreme sensitivity of the chaotic system on a primary state and parameters and the good randomness of a chaotic sequence, the check code sequence and the control code sequence can be obtained by grouping, excluding and extracting, and the check code sequence can be transmitted by a quantum channel, so as to guarantee the validity of two communicating parties and the effectiveness of the control code sequence.

Description

A kind of mbe-ssp control code method for generating sequence
Technical field
The invention belongs to field of quantum secure communication is and in particular to a kind of mbe-ssp control code method for generating sequence, the party Method includes control code sequence generating method based on chaos and Quantum Properties and control code sequence loops abandon algorithm.
Background technology
Quantum communications are important research directions in quantum information science, recent two decades having obtained development at full speed, Provide a kind of new thinking for secret signalling.Encryption key distribution and secret the sharing of quantum are wherein important two research Direction, achieves experimentally important progress in theory and all, is with a wide range of applications.
Document 1 " Chen Pan. quantum-key distribution and the shared theoretical research [d] of quantum secret. Tsing-Hua University, 2006. " public A kind of six state measurement base encryption quantum-key distribution scheme (measuring basis encryption-six states are opened Protocol), abbreviation mbe-ssp, selects three kinds of different measurement bases by control code, in the case that nothing makes an uproar no eavesdropping, Communication efficiency can reach absolutely, and for listener-in, needs to select one kind, hit probability from three kinds of measurement bases Only 13, thus the program not only communication efficiency is high and safety.But need to enter on the premise of control code sequence holds in close confidence OK, and this scheme control code sequence generating mode single, control code sequence effect under produce key sequence length For definite value, so, usually need in actual applications to reuse control code sequence, control code sequence has the risk of leakage; Document 2 " Zhao Long. quantum-key distribution and the theoretical research [d] of quantum signature. Northwest University, 2012. " illustrate by other The method of the control code sequence that quantum key distribution protocol (as bb84) obtains, exists non-adjustable between its length and safety coefficient The contradiction of sum, safety coefficient is higher, and the length of control code sequence is shorter, more needs to reuse, and so can cause more The leakage of multiple data quantity.Scheme enhances the security of control code sequence by the method for control code sequence of packets XOR, but institute The key sequence length of transmission remains as definite value, and control code sequence reuses frequency height, and the risk that there is leakage is big.
Content of the invention
For defect or deficiency present in above-mentioned prior art, the present invention proposes a kind of mbe-ssp control code sequence Generation method, the method is based on chaos and Quantum Properties, solves in existing mbe-ssp control code sequence generating method and exists Some problems.
A kind of mbe-ssp control code method for generating sequence, specifically includes following steps:
Step 1, distribution and negotiation phase: sender alice and recipient bob passes through reliable authentication center ca and obtains Shared initial value x0;Alice and bob is consulted by quantum channel, obtains parameter value μ, the iterations n and just of chaos system Beginning key sequence length n;
Step 2, initial key sequence generate: alice is by initial value x0Send into chaos system with parameter value μ, and iteration n Secondary, obtain n real number, and therefrom choose n real number x1a, x2a,...,xna;By x1a, x2a,...,xnaCarry out respectively at binaryzation Reason, generates binary system initial key sequence s0a;Meanwhile, bob is by initial value x0Send into and alice identical chaos with parameter value μ System, and iteration obtains n real number for n time, and with choosing n real number x from this n real number with alice identical mode1b, x2b,...,xnb, by x1b, x2b,...,xnbCarry out and x1a, x2a,...,xnaIdentical binary conversion treatment, generates binary system initial Key sequence s0b
Step 3, check code sequence and control code sequence generate: alice passes through packet, XOR and extraction and processes, from initial Key sequence s0aMiddle generation check code sequence s1aWith control code sequence s2a;Meanwhile, bob is also by the method same with alice, From initial key sequence s0bMiddle generation check code sequence s1bWith control code sequence s2b;Sequence s2a、s2bAs alice and bob it Between communication control code sequence;
Step 4, the transmission of check code sequence and certification: alice are by check code sequence s1aBob is sent to by quantum channel; Bob is by the check code receiving sequence s1aCheck code sequence s generating with step 31bCompare, and comparison result is fed back To alice;Work as s1aWith s1bIt is believed that control code sequence s when identical2aWith control code sequence s2bIdentical;By control code sequence s2aWith And control code sequence s2bAll it is designated as control code sequence k;
Step 5, the circulation generation of control code sequential shift abandon code word process: alice and bob all by control code sequence k Select measurement basic sequence, generate key sequence;In key sequence generating process, if required key sequence length is more than The measurement base sequence length that control code sequence k controls, then abandon algorithm using control code sequence k shift cycle and generate different controls Code sequence processed is in case use.
Further, in described step 1, described initial value x0∈[-1,1].
Further, in described step 1, parameter value μ ∈ [1.42,2] of described chaos system, initial key sequence length N is even number, and n < n.
Further, described initial value x0=0.8835, parameter value μ=1.92, iterations n=500 time, initial key Length n=20.
Further, in described step 2, the chaos system that alice and bob selects maps for logistic, x i + 1 = f ( x i ) = 1 - μx i 2 , xi∈ [- 1,1], μ ∈ [1.42,2].
Further, in described step 2, the operation of described binary conversion treatment: set threshold value k, when in initial key Certain real number value be more than k when, be mapped as 1, when certain real number value in initial key be less than or equal to k when, be mapped as 0;Specifically Form is expressed as follows:
y i = f ( x i ) = 0 x i ≤ k 1 x i > k
In formula, yiFor binary numeral, xiFor real number value, i represents the sequence number of the real number in initial key.
Further, in described step 3, described alice passes through packet, XOR and extraction and processes, from initial key sequence s0aMiddle generation check code sequence s1aWith control code sequence s2aSpecifically comprise the following steps that
By initial key sequence s0aIn binary code word be divided into one group successively two-by-two, and respectively by two two in every group System code word carries out XOR, obtains sequence s1a;Again to initial key sequence s0aExtracted, obtained sequence s2a, extract rule Then: when sequence s1aIn a certain position when being 1, then extract the second in two binary code words of this corresponding group;Work as s1aIn certain One when being 0, is then extracted first in two binary code words of this corresponding group;By sequence s2aAs alice and bob it Between communication control code sequence, by sequence s1aAs check code sequence.
Further, in described step 4, the quantum channel of described step 4 adopts hkh98 agreement.
Further, in described step 5, it is as follows that described control code sequence k shift cycle abandons algorithm:
Using first of control code sequence k and second code word combination as combination to be abandoned, after abandoning, when need When reusing control code sequence, the first of control code sequence k is moved to its last position and remaining bit moves forward successively, Obtain new control code sequence k1;New control code sequence k1First and the second bit word be combined as group to be abandoned Close;When needing to reuse control code sequence, the like, it is to be moved to it by the first of the control code sequence of last time One and remaining bit moves forward successively afterwards, obtain new control code sequence.
The present invention has exquisite sensitivity and good random of chaos sequence using chaos system to original state and parameter Property generate initial key sequence, check code sequence and control code sequence are obtained by packet, XOR, extraction, then are believed by quantum Road transmits check code sequence, to guarantee the legitimacy of communicating pair and the validity of control code sequence.When key sequence length is big When the measurement base sequence length that control code sequence is controlled, the present invention employs shift cycle to control code sequence and abandons calculation Method, makes the combination that control code sequence is abandoned when being used for multiple times all different, and control code sequence originally changes in continuous, corresponding Measurement basic sequence be also continually changing.Compare the scheme described in document 1 and document 2, the control code sequence generating in the present invention Row do not transmit in the channel, obtain effective information thus without allowing eavesdropping side.Meanwhile, generation is abandoned by shift cycle different Control code sequence, so that being transmitted longer key sequence and be occurred without repetition with the control code sequence of certain length, reduces The frequency that control code sequence repeats, reduces the risk of information leakage;Avoid simultaneously and in prior art, pass through other Existing implacable contradiction between the length of control code sequence of quantum key distribution protocol acquisition and safety coefficient.This In invention, when control code sequence length be l, cycle-index be m when, at this moment control code sequence have m kind change.
Brief description
Fig. 1 is the schematic diagram with negotiation phase for the distribution of step 1.
Below in conjunction with the drawings and specific embodiments, the present invention is further explained.
Specific embodiment
The mbe-ssp control code method for generating sequence of the present invention, comprises the following steps:
Step 1, distribution and negotiation phase: as shown in figure 1, sender alice and recipient bob is by reliable certification Center ca (such as, ca described in document 2) obtains shared initial value x0(x0∈[-1,1]);Alice and bob passes through quantum Channel negotiation, obtains parameter value μ (μ ∈ [1.42,2]), the iterations n and initial key sequence length n of chaos system, its In, n is even number, and n < n.
For example: set initial value x0=0.8835, parameter value μ=1.92, iterations n=500 time, initial key length n =20;Quantum channel adopts bb84 agreement;
Step 2, initial key sequence generate: alice is by initial value x0Send into chaos system with parameter value μ, and iteration n Secondary, obtain n real number, and therefrom choose n real number x1a, x2a,...,xna, by x1a, x2a,...,xnaCarry out respectively at binaryzation Reason, generates binary system initial key sequence s0a;Meanwhile, bob is by initial value x0Send into and alice identical chaos with parameter value μ System, and iteration obtains n real number for n time, and with choosing n real number x with alice identical mode from this n real number1b, x2b,...,xnb, by x1b, x2b,...,xnbCarry out and x1a, x2a,...,xnaIdentical binary conversion treatment, generates binary system initial Key sequence s0b
For example: the chaos system that alice and bob selects maps for logistic,μ∈(0, 2], xi∈[-1,1].When μ ∈ [1.42,2], system is in chaos state.
The operation of above-mentioned binary conversion treatment is as follows: sets threshold value k=0, when certain real number value in initial key is big When k, it is mapped as 1, when certain real number value in initial key is less than or equal to k, be mapped as 0.Concrete form is expressed as follows:
y i = f ( x i ) = 0 x i ≤ k 1 x i > k
In formula, yiFor binary numeral, xiFor real number value, i represents the sequence number of the real number in initial key.If alice and Initial key sequence s that bob generates0aAnd s0bIt is 01010000101101101110.
Step 3, check code sequence and control code sequence generate: alice passes through packet, XOR and extraction and processes, from initial Key sequence s0aMiddle generation check code sequence s1aWith control code sequence s2a;Specifically comprise the following steps that
By initial key sequence s0aIn binary code word be divided into one group successively two-by-two, and respectively by two two in every group System code word carries out XOR, obtains sequence s1a;Again to initial key sequence s0aExtracted, obtained sequence s2a, extract rule Then: when sequence s1aIn a certain position when being 1, then extract the second in two binary code words of this corresponding group;Work as s1aIn certain One when being 0, is then extracted first in two binary code words of this corresponding group;By sequence s2aAs alice and bob it Between communication control code sequence, by sequence s1aAs check code sequence;
Initial key sequence s of such as generation0aDuring for 01010000101101101110, s0aAfter being grouped it is: 01 01 00 00 10 11 01 10 11 10;Respectively two binary code words in every group are carried out XOR, sequence s obtaining1a For 1100101101;Follow again above-mentioned to sequence s2aDecimation rule to binary sequence s0aExtracted.For example, sequence s1a First be 1, this position correspond to binary sequence s0aIn first group 01, then extract the second 1 in this correspondence group, so according to After secondary extraction, obtain sequence s2aFor 1100011010;
Meanwhile, bob is also by the method same with alice (i.e. packet, XOR and extraction are processed), from initial key sequence s0bMiddle generation check code sequence s1bWith control code sequence s2b;Sequence s2bControl code sequence as communication between alice and bob;
Check code sequence is obtained by initiation sequence packet XOR, and control code sequence is by its corresponding check code sequence Row extract what initial key sequence obtained, as long as the check code sequence of alice with bob is consistent, then the control of alice and bob Code sequence should be just consistent.
Step 4, the transmission of check code sequence and certification: alice are by check code sequence s1aBob is sent to by quantum channel; In the present invention, the quantum channel of step 4 adopts hkh98 agreement;Bob is by the check code receiving sequence s1aWith step 3 generation Check code sequence s1bCompare, and comparison result is fed back to alice;Work as s1aWith s1bIt is believed that control code sequence s when identical2a And s2bAll effective, and control code sequence s2aWith control code sequence s2bIdentical;By control code sequence s2aAnd control code sequence s2bAll it is designated as control code sequence k;In the present invention, check code sequence s1aTransmitted by hkh98 agreement.
Step 5, the circulation generation of control code sequential shift abandon code word process: alice and bob all by control code sequence k Select measurement basic sequence, generate key sequence;In key sequence generating process, if required key sequence length is more than The measurement base sequence length that control code sequence k controls, in order to reduce the frequency reusing fixing control code sequence k, adopts Control code sequence k shift cycle is abandoned algorithm and is generated different control code sequences.Control code sequence k shift cycle abandons algorithm such as Under:
Using first of control code sequence k and second code word combination as combination to be abandoned, after abandoning, when need When reusing control code sequence, the first of control code sequence k is moved to its last position and remaining bit moves forward successively, Obtain new control code k1;New control code k1First and the second bit word be combined as combination to be abandoned;Work as needs When reusing control code sequence, the like, it is to be moved to its last position simultaneously by the first of the control code sequence of last time Remaining bit is moved forward successively, obtains new control code sequence.
For example, when control code sequence k is 1100011010, its first is 1, and second is also 1, then the code word group abandoned It is combined into 11;After abandoning, remaining control code sequence k ' is 00011010, is formed by { 00,01,10 } three groups of code word combination, if They with the corresponding relation of measurement base are: 00 is corresponding, 01 is corresponding, 10 is corresponding, then the measurement base row that control code k ' is controlled Sequence isWhen needing to reuse control code sequence, the first of control code sequence k is moved to last Position, second displacement is obtained new control code sequence k to first1For 1000110101;Now, its first is 1, second For 0, then the code word combination abandoned is 10;After abandoning, remaining control code sequence k1' it is 00110101;Control code sequence k1′ Formed by { 00,01,11 } three groups of code word combination, if they with the corresponding relation of corresponding measurement base are: 00 is corresponding, 01 is corresponding, 11 is corresponding.Then control code k1' the measurement base that controlled is ordered as
The following is the safety analysis that the solution of the present invention is carried out:
The method of the present invention make use of chaos system, logistic mapping, needs to provide to communicating pair alice and bob Initial value and chaotic parameter, wherein, initial value x0It is to be obtained by reliable authentication center ca, and the setting of parameter μ, repeatedly Consult to obtain by alice and bob both sides for frequency n, initial key length n.Wherein safety issue possibly be present at Lower 2 stages:
1st, distribution and negotiation phase (step 1).If ca is unreliable, it is x that ca can be obtained with effective information0It is impossible to Obtain parameter μ, n and n of chaos system, in order to obtain s0aAnd s0bSequence, ca can only go to eavesdrop the negotiation rank that he is not engaged in Section, now his status is the same with other listener-in.And communicating pair is consulted parameter and is completed by quantum channel, peace Quan Xingke to be ensured by Heisenberg uncertainty principle and quantum non-clone principle.Again because chaos system has to parameter extremely Sensitiveness, even if parameter has small difference the real-valued sequence that iteration goes out all can be caused entirely different, so step 1 can have Effect prevents the eavesdropping of unreliable ca and other listener-ins, to ensure s0aAnd s0bIt is safe.
2nd, check code sequence transmission stage (step 4).s1aEffect one be prove alice identity legitimacy, two is true Protect control code sequence s2aAnd s2bUniformity.Alice is needed s using hkh98 agreement1aIt is transferred to bob, if there is eavesdropping, Under the guarantee of quantum indeterminacy and unclonable principle, eavesdropping behavior will be easy to be realized by communicating pair;If eve can obtain Information, also simply s1aThe partial information less than 1/3, for eve, this information is not effective information because To s0aCarry out segmentation, XOR, extraction, obtain check code sequence s1aWith control code sequence s2a, s1aGenerating process be irreversible , that is, easily from s0aObtain s1a, further according to s1aObtain s2aBut, obtaining s1aIn the case of, counter can not push away s0a, also just push away not Go out s2a.Therefore, even if s1aPartial compromise, also not entail dangers to s2a.Therefore eve can not be from s1aPartial information derive s0a, S cannot be derived2a.So this stage is also safe.

Claims (8)

1. a kind of based on six state measurement bases encryption quantum-key distribution mbe-ssp control code method for generating sequence it is characterised in that Specifically include following steps:
Step 1, distribution and negotiation phase: it is shared that sender alice and recipient bob passes through reliable authentication center ca acquisition Initial value x0;Alice and bob is consulted by quantum channel, obtains parameter value μ, the iterations n of chaos system and initially close Key sequence length n;
Step 2, initial key sequence generate: the initial value x that alice will share0Send into chaos system with parameter value μ, and iteration n Secondary, obtain n real number, and therefrom choose n real number x1a, x2a,...,xna;By x1a, x2a,...,xnaCarry out respectively at binaryzation Reason, generates binary system initial key sequence s0a;Meanwhile, the initial value x that bob will share0Identical with alice with parameter value μ feeding Chaos system, and iteration obtains n real number for n time, and with choosing n real number from this n real number with alice identical mode x1b, x2b,...,xnb, by x1b, x2b,...,xnbCarry out and x1a, x2a,...,xnaIdentical binary conversion treatment, generates at the beginning of binary system Beginning key sequence s0b
Step 3, check code sequence and control code sequence generate: alice passes through packet, XOR and extraction and processes, from initial key Sequence s0aMiddle generation check code sequence s1aWith control code sequence s2a;Meanwhile, bob is also by the method same with alice, from first Beginning key sequence s0bMiddle generation check code sequence s1bWith control code sequence s2b;Sequence s2a、s2bAs logical between alice and bob The control code sequence of letter;
Step 4, the transmission of check code sequence and certification: alice are by check code sequence s1aBob is sent to by quantum channel;Bob will Check code sequence s receiving1aCheck code sequence s generating with step 31bCompare, and comparison result is fed back to alice;Work as s1aWith s1bIt is believed that control code sequence s when identical2aWith control code sequence s2bIdentical;By control code sequence s2aAnd Control code sequence s2bAll it is designated as control code sequence k;
Step 5, the circulation generation of control code sequential shift are abandoned code word process: alice and bob and are all selected by control code sequence k Measurement basic sequence, generates key sequence;In key sequence generating process, if required key sequence length is more than controlled The measurement base sequence length that code sequence k controls, then abandon algorithm using control code sequence k shift cycle and generate different control codes Sequence is in case use;
Wherein, described control code sequence k shift cycle is abandoned algorithm and is referred to:
Using first of control code sequence k and second code word combination as combination to be abandoned, after abandoning, when needing again During secondary use control code sequence, the first of control code sequence k is moved to its last position and remaining bit moves forward successively, obtains New control code k1;New control code k1First and the second bit word be combined as combination to be abandoned;When need again During using control code sequence, the like, it is to be moved to the first of the control code sequence of last time its last position and will remain Remaining position moves forward successively, obtains new control code sequence.
2. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 1, described Shared initial value x0∈[-1,1].
3. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 1, described Parameter value μ ∈ [1.42,2] of chaos system, initial key sequence length n is even number, and n < n.
4. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that described shared initial value x0 =0.8835, parameter value μ=1.92, iterations n=500, initial key length n=20.
5. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 2, alice The chaos system selecting with bob maps for logistic,xi∈ [- 1,1], μ ∈ [1.42,2].
6. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 2, described The operation of binary conversion treatment: set threshold value k, when certain real number value in initial key is more than k, be mapped as 1, when initial When certain real number value in key is less than or equal to k, it is mapped as 0;Concrete form is expressed as follows:
y i = f ( x i ) = 0 x i ≤ k 1 x i > k
In formula, yiFor binary numeral, xiFor real number value, i represents the sequence number of the real number in initial key.
7. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 3, described Alice passes through packet, XOR and extraction and processes, from initial key sequence s0aMiddle generation check code sequence s1aWith control code sequence s2aSpecifically comprise the following steps that
By initial key sequence s0aIn binary code word be divided into one group successively two-by-two, and respectively by two binary systems in every group Code word carries out XOR, obtains sequence s1a;Again to initial key sequence s0aExtracted, obtained sequence s2a, decimation rule: When sequence s1aIn a certain position when being 1, then extract the second in two binary code words of this corresponding group;Work as s1aIn a certain When position is for 0, then extract first in two binary code words of this corresponding group;By sequence s2aBetween alice and bob The control code sequence of communication, by sequence s1aAs check code sequence.
8. mbe-ssp control code method for generating sequence as claimed in claim 1 is it is characterised in that in described step 4, described The quantum channel of step 4 adopts hkh98 agreement.
CN201410209188.0A 2014-05-16 2014-05-16 Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence Expired - Fee Related CN103944712B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410209188.0A CN103944712B (en) 2014-05-16 2014-05-16 Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410209188.0A CN103944712B (en) 2014-05-16 2014-05-16 Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence

Publications (2)

Publication Number Publication Date
CN103944712A CN103944712A (en) 2014-07-23
CN103944712B true CN103944712B (en) 2017-01-18

Family

ID=51192212

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410209188.0A Expired - Fee Related CN103944712B (en) 2014-05-16 2014-05-16 Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence

Country Status (1)

Country Link
CN (1) CN103944712B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109889338A (en) * 2019-04-22 2019-06-14 苏州大学 Quantum encryption method based on chaos sequence
CN113328857B (en) * 2021-07-01 2022-05-24 北京创联易讯科技有限公司 Single-chip entrance guard type end-to-end voice cipher machine
CN113965318B (en) * 2021-09-18 2023-06-06 郑州信大捷安信息技术股份有限公司 Quantum migration security system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1761185A (en) * 2005-11-18 2006-04-19 清华大学 AES encrypted circuit structure for data stream executed in desequencing
CN101222318A (en) * 2008-01-23 2008-07-16 黑龙江大学 Chaotic sequence generation method and sequence generator of high speed high-precision chaotic function
CN101479774A (en) * 2006-06-23 2009-07-08 松下电器产业株式会社 Cipher processing apparatus, data converting method, data converting program, recording medium and integrated circuit
EP2359519A1 (en) * 2008-09-25 2011-08-24 Nokia Corp. Encryption/identification using array of resonators at transmitter and receiver

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8194858B2 (en) * 2009-02-19 2012-06-05 Physical Optics Corporation Chaotic cipher system and method for secure communication

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1761185A (en) * 2005-11-18 2006-04-19 清华大学 AES encrypted circuit structure for data stream executed in desequencing
CN101479774A (en) * 2006-06-23 2009-07-08 松下电器产业株式会社 Cipher processing apparatus, data converting method, data converting program, recording medium and integrated circuit
CN101222318A (en) * 2008-01-23 2008-07-16 黑龙江大学 Chaotic sequence generation method and sequence generator of high speed high-precision chaotic function
EP2359519A1 (en) * 2008-09-25 2011-08-24 Nokia Corp. Encryption/identification using array of resonators at transmitter and receiver

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
量子密钥分配及量子签名理论的研究;赵龙;《中国优秀硕士学位论文全文数据库》;20130115(第1期);I136-251 *

Also Published As

Publication number Publication date
CN103944712A (en) 2014-07-23

Similar Documents

Publication Publication Date Title
Shakiba-Herfeh et al. Physical layer security: Authentication, integrity, and confidentiality
CN101977112B (en) Public key cipher encrypting and decrypting method based on neural network chaotic attractor
CN105024994A (en) Secure certificateless hybrid signcryption method without pairing
CN101741566B (en) Method for entity authentication based on secret sharing encryption
CN102904726A (en) Classical channel message authentication method and device for quantum key distribution system
CN106533656B (en) A kind of key multilayer mixing method for encryption/decryption based on WSN
CN103973439B (en) A kind of multi-variable public key ciphering method
CN104854814A (en) Key sharing network device and configuration thereof
CN103944712B (en) Method for generating MBE-SSP (Multi Band Excitation-Service Switching Point) control code sequence
CN107493168A (en) Quanta identity authentication method and its application process during quantum key distribution
CN100594691C (en) Data transmission encryption method of MANET network
CN104113420A (en) Identity based aggregate signcryption method
GB2542751A (en) Future position commitment
CN103634788A (en) Certificateless multi-proxy signcryption method with forward secrecy
CN103746770A (en) Message authentication code and probability secret key distribution mechanism-based anti-pollution network coding method
Chen et al. A one-time pad encryption scheme based on efficient physical-layer secret key generation for intelligent IoT system
Asaad et al. Adaptive security approach for wireless sensor network using RSA algorithm
CN102739402A (en) Strong safety certification method based on HB+ in RFID (Radio Frequency Identification Devices) system
Zhao et al. Hardware assisted chaos based iot authentication
CN104780169A (en) Quantum repeater network coding scheme based on controller
CN104113543A (en) Block cipher based message authentication method
Nadeem Position-based quantum cryptography over untrusted networks
CN103686715B (en) Lightweight secrete discovery and dissemination method for wireless body area network safety data
CN101645772A (en) Pseudo random sequence generation method based on t semi-order and sequence generator
CN104283667A (en) Data transmission method, device and system thereof

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20170118