Quantum cryptography and secret-key distillation

Quantum Cryptography and Secret-Key Distillation

Volumn 9780521864855, Issue , 2006, Pages 1-261

  Van Assche, Gilles ^a  

^a STMICROELECTRONICS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DISTILLATION; ENGINEERING EDUCATION; QUANTUM THEORY; STUDENTS;

FUNDAMENTAL THEORY; GRADUATE STUDENTS; IMPLEMENTATION TECHNIQUES; PRIVACY AMPLIFICATION; SECRET KEY; SECURITY PRINCIPLES; STATE-OF-THE-ART TECHNIQUES;

QUANTUM CRYPTOGRAPHY;

EID: 84925088957     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511617744     Document Type: Book

References (196)

1. A., Aaron and B., Girod, Compression with side information using turbo codes, Proc. IEEE Data Compression Conf. (DCC) (2002).
2. R., Alléaume, F., Treussart, G., Messin et al., Experimental open-air quantum key distribution with a single-photon source, New J. Phys. 6, 92 (2004).
3. N., Alon and A., Orlitsky, Source coding and graph entropies, IEEE Trans. Inform. Theory 42, 1329-1339 (1996).
4. J., Arndt, Algorithms for programmers (working title), draft version of 2004- July-13, http://www.jjj.de/fxt/(2004).
5. L., R. Bahl, J., Cocke, F., Jelinek and J., Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory IT-20, 284-287 (1974).
6. H., J. Beker, Analog speech security systems, Advances in Cryptology - Eurocrypt ’82, Lecture Notes in Computer Science, 130-146 (1982).
7. M., Bellare, R., Canetti and H., Krawczyk, Keying hash functions for message authentication, Advances in Cryptology – Crypto.‘96, Lecture Notes in Computer Science, 1-15 (1996).
8. M., Ben-Or, M., Horodecki, D., W. Leung, D., Mayers and J., Oppenheim, The universal composable security of quantum key distribution, Proc. Second Theory of Cryptography Conf. (TCC), 386-406 (2005).
9. K., Bencheikh, T., Symul, A., Jankovic and J.-A., Levenson, Quantum key distribution with continuous variables, J. Mod. Opt. 48, 1903-1920 (2001).
10. C., H. Bennett and G., Brassard, Public-key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, 175-179 (1984).
11. C., H. Bennett, G., Brassard and J., Robert, Privacy amplification by public discussion, Si Am J. Comput. 17, 210-229 (1988).
12. C., H. Bennett, G., Brassard and A., K. Ekert, Quantum cryptography, Sci. Am. 267, 50-57 (1992).
13. C., H. Bennett, F., Bessette, G., Brassard, L., Salvail and J., Smolin, Experimental quantum cryptography, J. Cryptol. 5, 3-28 (1992).
14. C., H. Bennett, Quantum cryptography using any two non-orthogonal states, Phys. Rev. Lett. 68, 3121-3124 (1992).
15. C., H. Bennett, G., Brassard, C., Crepeau and U., M. Maurer, Generalized privacy amplification, IEEE Trans. Inform. Theory 41, 1915-1923 (1995).
16. C., H. Bennett, G., Brassard, S., Popescu et al., Purification of noisy entanglement and faithful teleportation via noisy channels, Phys. Rev. Lett. 76, 722-725 (1996).
17. C. Berrou, A. Glavieux and P. Thitimajshima, Near Shannon limit error- correction coding and decoding: turbo-codes, Proc. Int. Conf. Communications, 1064-1070 (1993).
18. D. S. Bethune, M. Navarro and W. P. Risk, Enhanced autocompensating quantum cryptography system, Appl. Opt. LP 41, 1640-1648 (2002).
19. A. Beveratos, R. Brouri, T. Gacoin et al., Single photon quantum cryptography, Phys. Rev. Lett. 89, 187-901 (2002).
20. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Advances in Cryptology – Crypto.‘90, Lecture Notes in Computer Science, 2-21 (1990).
21. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, J. Cryptol. 4, 3-72 (1991).
22. E. Biham and A. Shamir, Differential cryptanalysis of the full 16-round DES, Advances in Cryptology – Crypto 92, Lecture Notes in Computer Science, 494-502 (1992).
23. E. Biham, M. Boyer, P. O. Boykin, T. Mor and V. Roychowdhury, A proof of the security of quantum key distribution, Proc. of the 32nd Annual ACM Symp. on Theory of Computing, 715-724 (1999).
24. J. Black, S. Halevi, H. Krawczyk, T. Krovetz and P. Rogaway, UMAC: fast and secure message authentication, Advances in Cryptology – Crypto.‘99, Lecture Notes in Computer Science, 216-233 (1999).
25. M. Bloch, A. Thangaraj and S. W. McLaughlin, Efficient reconciliation of correlated continuous random variables using LDPC codes, arXiv e-print cs.IT/0509041 (2005).
26. M. Bourennane, F. Gibson, A. Karlsson et al., Experiments on long- wavelength (1550 nm) ‘plug and play’ quantum cryptography systems, Opt. Express 4, 383-387 (1999).
27. G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, Advances in Cryptology – Eurocrypt.‘93, Lecture Notes in Computer Science, 410-423 (1993).
28. B. P. Brent, S. Larvala and P. Zimmermann, A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377, Math. Comp. 72, 1443-1452 (2003).
29. B. P. Brent, S. Larvala and P. Zimmermann, Search for primitive trinomials (mod 2), http://web.comlab.ox.ac.uk/oucl/work/richard.brent/trinom.html (2004).
30. D. Brub, M. Cinchetti, G. M. D’Ariano and C. Macchiavello, Phase covariant quantum cloning, Phys. Rev. A 62, 012-302 (2000).
31. W. T. Buttler, S. K. Lamoreaux, J. R. Torgerson et al., Fast, efficient error reconciliation for quantum cryptography, Phys. Rev. A 67, 052-303 (2003).
32. C., Cachin, Entropy Measures and Unconditional Security in Cryptography, Ph.D. thesis, ETH Zürich (1997).
33. A. R. Calderbank, Multilevel codes and multistage decoding, IEEE Trans. Inform. Theory 37, 222-229 (1989).
34. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098-1105 (1996).
35. J., Cardinal, Quantization With an Information-Theoretic Distortion Measure, Technical Report 491, Universite Libre de Bruxelles (2002).
36. J., Cardinal and G., Van Assche, Construction of a shared secret key using continuous variables, Proc. IEEE Inform. Th. Workshop (ITW) (2003).
37. J., Cardinal, S., Fiorini and G., Van Assche, On minimum entropy graph colorings, Proc. IEEE International Symposium on Information Theory (ISIT) (2004).
38. J., L. Carter and M., N. Wegman, Universal classes of hash functions, J. Com- put. Syst. Sci. 18, 143-154 (1979).
39. N., J. Cerf, A., Ipe and X., Rottenberg, Cloning of continuous quantum variables, Phys. Rev. Lett. 85, 1754-1757 (2000).
40. N., J. Cerf, M., Levy and G., Van Assche, Quantum distribution of Gaussian keys using squeezed states, Phys. Rev. A 63, 052-311 (2001).
41. G., Chiribella, G., M. D’Ariano, P., Perinotti and N., J. Cerf, Extremal quantum cloning machines, Phys. Rev. A 72, 042-336 (2005).
42. M., Christandl, R., Renner and A., Ekert, A generic security proof for quantum key distribution, ar Xiv e-print quant-ph/0402131 (2004).
43. TM, http://www.comscire.com/Products/J1000KU/(2005).
44. T., H. Cormen, C., E. Leiserson, R., L. Rivest and C., Stein, Introduction to Algorithms, second edition, Cambridge, MA, MIT Press (2001).
45. N., T. Courtois and J., Pieprzyk, Cryptanalysis of block ciphers with overdefined systems of equations, Advances in Cryptology - Asiacrypt 2002, Lecture Notes in Computer Science, 267-287 (2002).
46. T., M. Cover and J., A. Thomas, Elements of Information Theory, New York, Wiley & Sons (1991).
47. P., Crescenzi, V., Kann, M., Halldorsson, M., Karpinski and G., Woeginger, A Compendium of NP Optimization Problems, http://www.nada.kth.se/∼viggo/problemlist/compendium.html (2005).
48. I., Csiszar and J., Körner, Broadcast channels with confidential messages, IEEE Trans. Inform. Theory 24, 339-348 (1978).
49. K., M. Cuomo and A., V. Oppenheim, Circuit implementation of synchronized chaos with applications to communications, Phys. Rev. Lett. 71, 65-68 (1993).
50. G., M. D’Ariano, C., Macchiavello and N., Sterpi, Systematic and statistical errors in homodyne measurements of the density matrix, Quantum Semiclass. Opt. 9, 929-939 (1997).
51. G., M. D’Ariano, M., G. Paris and M., F. Sacchi, Quantum tomography, Adv. Imag. Elect. Phys. 128, 205-308 (2003).
52. J., Daemen and V., Rijmen, The Design of Rijndael, Berlin, Springer-Verlag (2002).
53. I., Devetak and A., Winter, Relating quantum privacy and quantum coherence: an operational approach, Phys. Rev. Lett. 93, 080-501 (2004).
54. W., Diffie and M., E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22, 644-654 (1976).
55. B., Efron and R., J. Tibshirani, An Introduction to the Bootstrap, London, CRC Press LLC (1998).
56. A., Einstein, B., Podolsky and N., Rosen, Can quantum-mechanical description of physical reality be considered complete?, Phys. Rev. 47, 777-780 (1935).
57. C., Elliott, Building the quantum network, New J. Phys. 4, 46 (2002).
58. C., Elliott, D., Pearson and G., Troxel, Quantum cryptography in practice, 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 227-238 (2003).
59. C., Ellison, C., Hall, R., Milbert and B., Schneier, Protecting secret keys with personal entropy, Future Gener. Comp. Syst. 16, 311-318 (2000).
60. Federal Information Processing Standard (FIPS), Data Encryption Standard, Publication 46, Washington D.C., National Bureau of Standards, U.S. Department of Commerce (1977).
61. C., A. Fuchs, N., Gisin, R., B. Griffiths, C.-S., Niu and A., Peres, Optimal eavesdropping in quantum cryptography. I Information bound and optimal strategy, Phys. Rev. A 56, 1163-1172 (1997).
62. E., Furukawa and K., Yamazaki, Application of existing perfect code to secret key reconciliation, Conf. Proc. Int. Symp. Commun. Inform. Tech., 397-400 (2001).
63. R., G. Gallager, Low density parity check codes, IRE Trans. Inf. Theory IT-8, 21-28 (1962).
64. N., Gisin, G., Ribordy, W., Tittel and H., Zbinden, Quantum cryptography, Rev. Mod. Phys. 74, 145-195 (2002).
65. N., Gisin, S., Fasel, B., Kraus, H., Zbinden and G., Ribordy, Trojan horse attacks on quantum key distribution systems, ar Xiv e-print quant-ph/0507063 (2005).
66. Gobby, Z. L. Yuan and A., J. Shields, Quantum key distribution over 122 km of standard telecom fiber, Appl. Phys. Lett. 84, 3762-3864 (2004).
67. S., Goldwasser and S., Micali, Probabilistic encryption, J. Comp. Syst. Sci. 28, 270-299 (1984).
68. D., Gottesman and J., Preskill, Secure quantum key distribution using squeezed states, Phys. Rev. A 63, 022-309 (2001).
69. D., Gottesman and H.-K., Lo, Proof of security of quantum key distribution with two-way classical communications, IEEE Trans. Inform. Theory 49, 457-475 (2003).
70. D., Gottesman, H.-K., Lo, N., Luotkenhaus and J., Preskill, Security of quantum key distribution with imperfect devices, Quantum Inf. Comput. 4, 325-360 (2004).
71. F., Gray, Pulse Code Communication, United States Patent 2,632,058 (March 17, 1953).
72. R., M. Gray and D., L. Neuhoff, Quantization, IEEE Trans. Inform. Theory 44, 2325-2383 (1998).
73. W., Greiner, Quantum Mechanics—An Introduction, third edition, Berlin, Springer-Verlag (1994).
74. F., Grosshans and P., Grangier, Continuous variable quantum cryptography using coherent states, Phys. Rev. Lett. 88, 057-902 (2002).
75. F., Grosshans and P., Grangier, Reverse reconciliation protocols for quantum cryptography with continuous variables, ar Xiv e-print quant-ph/0204127 (2002).
76. F., Grosshans, Communication et Cryptographie Quantiques avec des Variables Continues, Ph.D. thesis, Universite Paris XI (2002).
77. F., Grosshans, G., Van Assche, J., Wenger et al., Quantum key distribution using Gaussian-modulated coherent states, Nature 421, 238-241 (2003).
78. F., Grosshans, J., Wenger, R., Brouri, N., J. Cerf and P., Grangier, Virtual entanglement and reconciliation protocols for quantum cryptography with continuous variable, Quantum Inf. Comput. 3, 535-552 (2003).
79. F., Grosshans and N., J. Cerf, Continuous-variable quantum cryptography is secure against non-Gaussian attacks, Phys. Rev. Lett 92, 047-905 (2004).
80. F., Grosshans, Collective attacks and unconditional security in continuous variable quantum key distribution, Phys. Rev. Lett. 94, 020-504 (2005).
81. C., G. Gönther, An identity-based key-exchange protocol, Advances in Cryptology – Eurocrypt.‘89, Lecture Notes in Computer Science, 29-37 (1989).
82. M., Hillery, Quantum cryptography with squeezed states, Phys. Rev. A 61, 022-309 (2000).
83. A., S. Holevo, The capacity of the quantum channel with general signal states, IEEE Trans. Inform. Theory 44, 269-273 (1998).
84. Horst Guörtz Institute for IT-Security and Institute for Applied Information Processing and Communications, Fourth Conference on the Advanced Encryption Standard (AES) (2004).
85. D., A. Huffman, A method for the construction of minimum redundancy codes, Proc. IRE, 1098-1101 (1952).
86. R., J. Hughes, W., T. Buttler, P., G. Kwiat et al., Practical quantum cryptography for secure free-space communications, ar Xiv e-print quant-ph/9905009 (1999).
87. R., J. Hughes, J., E. Nordholt, D., Derkacs and C., G. Peterson, Practical free- space quantum key distribution over 10 km in daylight and at night, New J. Phys 4, 43 (2002).
88. W.-Y., Hwang, Quantum key distribution with high loss: toward global secure communication, Phys. Rev. Lett. 91, 057-901 (2003).
89. S., Iblisdir, G., Van Assche and N., J. Cerf, Security of quantum key distribution with coherent states and homodyne detection, Phys. Rev. Lett. 93, 170-502 (2004).
90. TM, http://www.idquantique.com/(2005).
91. TM, http://www.idquantique.com/(2005).
92. D., Kahn, The Codebreakers, Scribner (1996).
93. S., C. Kak, Scrambling and randomization, Advances in Cryptology – Crypto.’81, Lecture Notes in Computer Science, 59-63 (1981).
94. J., Kelsey, B., Schneier, D., Wagner and C., Hall, Side channel cryptanalysis of product ciphers, J. Comput. Secur. 8, 141-158 (2000).
95. A., Kerckhoffs, La cryptographie militaire, Journal des sciences militaires IX, 5-38 (1883).
96. D., E. Knuth, The Art of Computer Programming, vol. 2, third edition, Reading, MA, Addison-Wesley (1997).
97. P., Kocher, J., Jaffe and B., Jun, Differential power analysis, Advances in Cryptology – Crypto‘99, Lecture Notes in Computer Science, 388-397 (1999).
98. R., König, U., Maurer and R., Renner, Privacy amplification secure against an adversary with selectable knowledge, Proc. IEEE International Symposium on Information Theory (ISIT) (2004).
99. R., König, U., Maurer and R., Renner, On the power of quantum memory, IEEE Trans. Inform. Theory 51, 2391-2401 (2005).
100. J., Körner and A., Orlitsky, Zero-error information theory, IEEE Trans. Inform. Theory 44, 2207-2229 (1998).
101. P., Koulgi, E., Tuncel, S., Regunathan and K., Rose, Minimum redundancy zerro-error source coding with side information, Proc. IEEE International Symposium on Information Theory (ISIT) (2001).
102. P., Koulgi, E., Tuncel and K., Rose, On zero-error coding of correlated sources, Proc. IEEE International Symposium on Information Theory (ISIT), 62 (2002).
103. P., Koulgi, E., Tuncel, S., Regunathan and K., Rose, On zero-error source coding with decoder side information, IEEE Trans. Inform. Theory 49, 99-111 (2003).
104. H., Krawczyk, LFSR-based hashing and authentication, Advances in Cryptology – Crypto.‘94, Lecture Notes in Computer Science, 129-139 (1994).
105. C., Kurtsiefer, P., Zarda, M., Halder et al., A step towards global key distribution, Nature 419, 450 (2002).
106. G., G. Langdon, An introduction to arithmetic coding, IBM J. Res. Dev. 28, 135-149 (1984).
107. A., D. Liveris, Z., Xiong and C., N. Georghiades, Compression of binary sources with side information at the decoder using LDPC codes, IEEE Commun. Lett. 6, 440-442 (2002).
108. H.-K., Lo and H., F. Chau, Unconditional security of quantum key distribution over arbitrarily long distances, Science 283, 2050-2056 (1999).
109. H.-K., Lo, Method for decoupling error correction from privacy amplification, New J. Phys 5, 36 (2003).
110. H.-K., Lo, X., Ma and K., Chen, Decoy state quantum key distribution, Phys. Rev. Lett. 94, 230-504 (2005).
111. J., Lodewyck, T., Debuisschert, R., Tualle-Brouri and P., Grangier, Controlling excess noise in fiber-optics continuous-variable quantum key distribution, Phys. Rev. A 72, 050-303(R) (2005).
112. S., Lorenz, N., Korolkova and G., Leuchs, Continuous variable quantum key distribution using polarization encoding and post selection, Appl. Phys. B 79, 273-277 (2004).
113. MagiQ Technologies, QPNTM, http://www.magiqtech.com/(2005).
114. Y., Mansour, N., Nisan and P., Tiwari, The computational complexity of universal hash functions, Theor. Comput. Sci. 107, 121-133 (1993).
115. M., Matsui, Linear cryptanalysis method for DES cipher, Advances in Cryptology - Eurocrypt‘93, Lecture Notes in Computer Science, 386-397 (1993).
116. M., Matsui, The first experimental cryptanalysis of the data encryption standard, Advances in Cryptology – Crypto.‘94, Lecture Notes in Computer Science, 1-11 (1994).
117. U., M. Maurer, Secret key agreement by public discussion from common information, Ie Ee Trans. Inform. Theory 39, 733-742 (1993).
118. U., Maurer, Information-theoretically secure secret-key agreement by NOT authenticated public discussion, Advances in Cryptology – Eurocrypt.‘97, Lecture Notes in Computer Science, 209-225 (1997).
119. U., M. Maurer and S., Wolf, The intrinsic conditional mutual information and perfect secrecy, Proc. IEEE International Symposium on Information Theory (ISIT), 88 (1997).
120. U., M. Maurer and S., Wolf, Unconditionally secure key agreement and the intrinsic conditional information, IEEE Trans. Inform. Theory 45, 499-514 (1999).
121. U., M. Maurer, Authentication theory and hypothesis testing, IEEE Trans. Inform. Theory 46, 1350-1356 (2000).
122. U., Maurer and S., Wolf, Information-theoretic key agreement: from weak to strong secrecy for free, Advances in Cryptology - Eurocrypt 2000, Lecture Notes in Computer Science, 351-368 (2000).
123. U., Maurer and S., Wolf, Secret-key agreement over unauthenticated public channels—part I: definitions and a completeness Result, IEEE Trans. Inform. Theory 49, 822-831 (2003).
124. U., Maurer and S., Wolf, Secret-key agreement over unauthenticated public channels—part II: the simulatability condition, IEEE Trans. Inform. Theory 49, 832-838 (2003).
125. U., Maurer and S., Wolf, Secret-key agreement over unauthenticated public channels—part III: privacy amplification, IEEE Trans. Inform. Theory 49, 839-851 (2003).
126. D., Mayers, Unconditional security in quantum cryptography, J. ACM 48, 351-406 (2001).
127. A., J. Menezes, P., C. van Oorschot and S., A. Vanstone, Handbook of Applied Cryptography, London, CRC Press LLC (1997).
128. A., Muller, H., Zbinden and N., Gisin, Quantum cryptography over 23 km in installed under-lake telecom fibre, Europhys. Lett. 33, 335 (1996).
129. J., Muramatsu, Secret key agreement from correlated source outputs using LDPC matrices, Proc. IEEE International Symposium on Information Theory (ISIT) (2004).
130. J., Muramatsu, T., Uyematsu and T., Wadayama, Low-density parity-check matrices for coding of correlated sources, IEEE Trans. Inform. Theory 51, 3645-3654 (2005).
131. S., Murphy and M., J. Robshaw, Essential algebraic structure within the AES, Advances in Cryptology - Crypto 2002, Lecture Notes in Computer Science, 1-16 (2002).
132. National Institute of Standards and Technology (NIST), Advanced Encryption Standard, http://www.nist.gov/aes (2000).
133. M., Navascues and A., Acin, Security bounds for continuous variables quantum key distribution, Phys. Rev. Lett. 94, 020-505 (2005).
134. P., Navez, Statistical confidentiality tests for a quantum transmission using continuous variables, Eur. Phys. J. D 18, 219-228 (2002).
135. K.-C., Nguyen, Extension des Protocoles de Reconciliation en Cryptographie Quantique, Masters thesis, Universite Libre de Bruxelles (2002).
136. K.-C., Nguyen, G., Van Assche and N., J. Cerf, Side-information coding with turbo codes and its application to quantum key distribution, Proc. International Symposium on Information Theory and its Applications (ISITA) (2004).
137. K.-C., Nguyen, G., Van Assche and N., J. Cerf, One-dimensional and multidimensional reconciliation using turbo codes for quantum key distribution, Proc. 26th Symp. on Inform. Theory in the Benelux (2005).
138. M., A. Nielsen and I., L. Chuang, Quantum Computation and Quantum Information, Cambridge, Cambridge University Press (2000).
139. N., Nisan and D., Zuckerman, Randomness is linear in space, J. Comput. Syst. Sci. 52, 43-52 (1996).
140. K., G. Paterson, F., Piper and R., Schack, Why quantum cryptography?, ar Xiv e-print quant-ph/0406147 (2004).
141. Y., Peres, Iterating von Neumann's procedure for extracting random bits, Annals of Statistics 20, 590-597 (1992).
142. J., Preskill, Lecture Notes for Physics 229: Quantum Information and Computation, http://theory.caltech.edu/∼preskill/ph229/(1998).
143. Protego, R200-USBTM TRNG Product Specification, http://www.protego.se/sg200_d.htm (2005).
144. T., C. Ralph, Continuous variable quantum cryptography, Phys. Rev. A 61, 010-303 (2000).
145. R., Raz, O., Reingold and S., Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, Proc. Symp. Theory of Computing, 149-158 (1999).
146. M., D. Reid, Quantum cryptography with a predetermined key, using continuous-variable Einstein-Podolsky-Rosen correlations, Phys. Rev. A 62, 062-308 (2000).
147. R., Renner and S., Wolf, New bounds in secret-key agreement: the gap between formation and secrecy extraction, Advances in Cryptology - Eurocrypt 2003, Lecture Notes in Computer Science, 562-577 (2003).
148. A., Rényi, On measures of entropy and information, Proc. 4th Berkeley Symp. on Math. Statistics and Prob., 547-561 (1961).
149. G., Ribordy, J., Gautier, H., Zbinden and N., Gisin, Fast and user-friendly quantum key distribution, J. Mod. Opt. 47, 517-531 (2000).
150. R., L. Rivest, A., Shamir and L., M. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM 21, 120-126 (1978).
151. B., Sanders, J., Vučković and P., Grangier, Single photons on demand, Euro- phys. News 36, 56-58 (2005).
152. D., C. Schmidt, The ADAPTIVE Communication Environment (ACETM), http://www.cs.wustl.edu/∼schmidt/ACE.html (2005).
153. B., Schneier, Applied Cryptography, second edition, New York, John Wiley & Sons (1995).
154. A., Schönhage and V., Strassen, Schnelle Multiplikation grofier Zahlen, Computing 7, 281-292 (1971).
155. A., Schönhage, Schnelle Multiplikation von Polynomen uber Korpern der Charakteristik 2, Acta Inform. 7, 395-398 (1977).
156. B., Schumacher, Quantum coding, Phys. Rev. A 51, 2738-2747 (1995).
157. B., Schumacher and M., D. Westmoreland, Sending classical information via noisy quantum channels, Phys. Rev. A 56, 131-138 (1997).
158. M., O. Scully and M., S. Zubairy, Quantum Optics, Cambridge, Cambridge University Press (1997).
159. C., E. Shannon, Analogue of the Vernam System for Continuous Time Series, Memorandum MM 43-110-44, Bell Laboratories (1943).
160. C., E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J. 27, 623-656 (1948).
161. C., E. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J. 28, 656-715 (1949).
162. P., W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings of the 35th Symposium on Foundations of Computer Science, 124-134 (1994).
163. P., W. Shor and J., Preskill, Simple proof of security of the BB84 quantum key distribution protocol, Phys. Rev. Lett. 85, 441-444 (2000).
164. C., Silberhorn, N., Korolkova and G., Leuchs, Quantum key distribution with bright entangled beams, Phys. Rev. Lett. 88, 167-902 (2002).
165. C., Silberhorn, T., C. Ralph, N., Lütkenhaus and G., Leuchs, Continuous variable quantum cryptography - beating the 3 dB loss limit, Phys. Rev. Lett. 89, 167-901 (2002).
166. S., Singh, The Code Book, New York, Doubleday (1999).
167. D., Slepian and J., K. Wolf, Noiseless coding of correlated information sources, IEEE Trans. Inform. Theory 19, 471-480 (1973).
168. A., Steane, Multiple particle interference and quantum error correction, Proc. R. Soc. London A 452, 2551-2577 (1996).
169. D., R. Stinson, Universal hashing and authentication codes, Design. Code. Cryptogr. 4, 369-380 (1994).
170. D., R. Stinson, Cryptography Theory and Practice, second edition, London, CRC Press LLC (2002).
171. D., Stucki, N., Gisin, O., Guinnard, G., Ribordy and H., Zbinden, Quantum key distribution over 67 km with a plug & play system, New J. Phys 4, 41 (2002).
172. L., Trevisan, Extractors and pseudorandom generators, J. ACM 48, 860-879 (2001).
173. G., Van Assche, J., Cardinal and N., J. Cerf, Reconciliation of a quantum- distributed Gaussian key, IEEE Trans. Inform. Theory 50, 394-400 (2004).
174. G., Van Assche, Information-Theoretic Aspects of Quantum Key Distribution, Ph.D. thesis, Universite Libre de Bruxelles (2005).
175. G., Van Assche, S., Iblisdir and N., J. Cerf, Secure coherent-state quantum key distribution protocols with efficient reconciliation, Phys. Rev. A 71, 052-304 (2005).
176. G., S. Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communications, J. IEEE 55, 109-115 (1926).
177. U., Wachsmann, R., F. Fischer and J., B. Huber, Multilevel codes: theoretical concepts and practical design rules, IEEE Trans. Inform. Theory 45, 1361-1391 (1999).
178. E., Waks, K., Inoue, C., Santori et al., Quantum cryptography with a photon turnstile, Nature 420, 762 (2002).
179. J., Walker, Hot Bits: Genuine Random Numbers, Generated by Radioactive Decay, http://www.fourmilab.ch/hotbits/(2005).
180. D., F. Walls and G., J. Milburn, Quantum Optics, Berlin, Springer-Verlag (1994).
181. X.-B., Wang, Beating the photon-number-splitting attack in practical quantum cryptography, Phys. Rev. Lett. 94, 230-503 (2005).
182. M., N. Wegman and J., L. Carter, New hash functions and their use in authentication and set equality, J. Comput. Syst. Sci. 22, 265-279 (1981).
183. E., W. Weisstein, Number Theoretic Transform, from Math World - a Wolfram web resource, http://mathworld.wolfram.com/NumberTheoreticTransform.html (2005).
184. E., W. Weisstein, Gray Code, from Math World - a Wolfram web resource, http://mathworld.wolfram.com/GrayCode.html (2005).
185. J., Wenger, Dispositifs Impulsionnels pour la Communication Quantique a Variables Continues, Ph.D. thesis, Universite Paris XI (2004).
186. S., Wiesner, Conjugate coding, Sigact News 15, 78-88 (1983).
187. H., S. Witsenhausen, The zero-error side information problem and chromatic numbers, IEEE Trans. Inform. Theory 22, 592-593 (1976).
188. T., Wörz and J., Hagenauer, Iterative decoding for multilevel codes using reliability information, Proc. IEEE Globecom Conference, 1779-1784 (1992).
189. A., D. Wyner, The wire-tap channel, Bell Syst. Tech. J. 54, 1355-1387 (1975).
190. Y.-O., Yan and T., Berger, On instantaneous codes for zero-error coding of two correlated sources, Proc. IEEE International Symposium on Information Theory (ISIT) (2000).
191. H., Zbinden, J., Gautier, N., Gisin et al., Interferometry with Faraday mirrors for quantum cryptography, Electron. Lett. 33, 586-588 (1997).
192. H., Zbinden, H., Bechmann-Pasquinucci, N., Gisin and G., Ribordy, Quantum cryptography, Appl. Phys. B 67, 743-748 (1998).
193. Q., Zhao and M., Effros, Optimal code design for lossless and near lossless source coding in multiple access networks, Proc. IEEE Data Compression Conf. (DCC), 263-272 (2001).
194. Q., Zhao, S., Jaggi and M., Effros, Side information source coding: low- complexity design and source independence, Proc. Asilomar Conference on Signals and Systems (2002).
195. Q., Zhao and M., Effros, Low complexity code design for lossless and near- lossless side information source codes, Proc. IEEE Data Compression Conf. (DCC) (2003).
196. Q., Zhao and M., Effros, Lossless and near-lossless source coding for multiple access networks, IEEE Trans. Inform. Theory 49, 112-128 (2003).