#### DMCA

## (1) Let Gi,Hi be the generator matrix and parity check matrix of Ci respectively, (i=1,2). Without loss of generality,

### Citations

2498 |
Quantum Computation and Quantum Information
- Nielsen, Chuang
- 2000
(Show Context)
Citation Context ...des, which is an NP-C problem [10] . Though quantum algorithms are shown exponentially faster than classical ones when coping with some problems, such as integer factor and discrete logarithm problem =-=[13]-=- , it is widely believed that NP-C problems are still intractable by quantum (probabilistic) polynomial-time Turing machines [14] . We know that the Goppa codes used in the proposed scheme are uniquel... |

980 | Quantum Cryptography: Public key distribution and coin tossing", - Bennett, Brassard - 1984 |

37 | Deterministic secure direct communication using entanglement. - Bostrom, Felbinger - 2002 |

11 | Eavesdropping on the “Ping-Pong” Quantum Communication Protocol. - Wojcik - 2003 |

3 |
Good quantum error-correcting codes exist
- AR, PW
- 1996
(Show Context)
Citation Context ...⎣ 2 ⎦ measured and subsequently corrected without disturbing the encoded states. d is called the minimal distance of Q. Quantum CSS codes can be constructed by using classical linear codes. Theorem 1 =-=[6]-=- ⊥ . Suppose that there exist two classical binary linear codes C1=[n,k1,d1],C2=[n,k2,d2], and ⊆C (so that n≤k 1+k 2). Then there exists a QECC 1 2 1 2 expressed as 2 n C1 2 Q:[[ n, k = k + k − n,min{... |

3 | Multiple particle interference and quantum error correction - AM - 1996 |

3 |
A public-key cryptosystem based on algebraic coding theory
- RJ
- 1978
(Show Context)
Citation Context ...nd. Goppa codes have been widely used to construct public-key encryption systems and message authentication codes since they have a fast decoding algorithm and a large number of nonequivalent classes =-=[10]-=- . Here we only consider binary Goppa Codes. (4) (5)s512 Journal of Software �������� Vol.17, No.3, March 2006 Definition 1. Suppose g(z) is a polynomial of degree t over finite fields F m . Let 2 L =... |

2 | Secure direct communication with a quantum one-time pad - FG, GL - 2004 |

2 | Quantum error correction via codes over GF(4 - AR, EM, et al. - 1998 |

1 | Englert BG, Kurtsierfer C. Secure communication with a publicly known key - Beige |

1 | Lü X, Feng DG. Computationally secure uncloneable encryption scheme - Ma - 2004 |

1 |
The algebraic decoding of Goppa codes
- NJ
(Show Context)
Citation Context ...mod g( z) i= 0 z γ i From the above definitions, it’s easy to know that Goppa code Γ(L,g(z)) is uniquely determined by g(z) and L. It can also be proved that Γ(L,g(z)) has parameters [n,k>n−mt,d≥t+1] =-=[11]-=- . By some computing results over finite fields we know that Goppa codes have a large number of nonequivalent classes, which makes it possible to construct cryptosystems by using Goppa codes. 3 The Pr... |

1 |
Authentication protocol providing user anonymity and untraceability in wireless mobile communication systems
- CS
(Show Context)
Citation Context ...∈C1 2 1 ( −1) ( v+ m⋅D ) ⋅Z ′ ⋅Z ′ 1 F 2 (7) |v+m⋅D+X′+ X ′ 〉 (9) t ′′ ⎛ N ⎞ For quantum CCS codes, there are 3 ⋅ ⎜ ⎟ error vectors whose Hamming weight is t ′′ . Borrowing the idea ⎝ t′ ′ ⎠ from Ref.=-=[12]-=-, we can construct one-to-one correspondence between this set of quantum error vectors e ′′ = ( X ′ Z′ ′ )s���� �� : �������� Calderbank-Shor-Steane ������������������������ 513 t ′′ ⎛ N ⎞ and integer... |

1 |
Quantum public-key cryptosystems, In: Bellare M, ed. Advances of Cryptology-CRYPTO 2000. LNCS 1880
- Okamoto, Tanaka, et al.
- 2000
(Show Context)
Citation Context ...h some problems, such as integer factor and discrete logarithm problem [13] , it is widely believed that NP-C problems are still intractable by quantum (probabilistic) polynomial-time Turing machines =-=[14]-=- . We know that the Goppa codes used in the proposed scheme are uniquely decided by polynomials g(Z) and ordered sets L. Therefore, if Eve wants to get the fast decoding algorithm of Goppa codes C 1,C... |