Advertisement

Network Security

  • Stamatios V. Kartalopoulos

Keywords

Elliptic Curve Elliptic Curf Wavelength Division Multiplex Quantum Cryptography Elliptic Curve Cryptography 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aeschylus, Agamemnon, Loeb Classical Library.Google Scholar
  2. Polybius, Histories, Book X, Loeb Classical Library.Google Scholar
  3. Xenophon, Anabasis, Loeb Classical Library.Google Scholar
  4. D. Kahn, “Seizing the Enigma: The Race to Break the German U-Boats Codes, 1939-1943”, 1991.Google Scholar
  5. A. Stripp, “The Enigma Machine: Its Mechanism and Use”, in Codebreakers: The Inside Story of Bletchley Park, F.H. Hinsley and A. Stripp eds. pp. 83–88, Oxford University Press, 1993.Google Scholar
  6. S.V. Kartalopoulos, “A Primer on Cryptography in Communications”, IEEE Communications Magazine, vol. 44, no. 4, 2006, pp. 146–151.CrossRefGoogle Scholar
  7. S.V. Kartalopoulos,Understanding SONET/SDH and ATM, IEEE Press, 1999; also Prentice Hall of India.Google Scholar
  8. S.V. Kartalopoulos, Introduction to DWDM Technology: Data in a Rainbow, Wiley/IEEE Press, 2000; published also in India and China.Google Scholar
  9. FIPS Pub 190, Guideline for the Use of Advanced Authentication Technology Alternatives, September 28, 1994.Google Scholar
  10. FIPS Pub 196, Entity Authentication Using Public Key Cryptography, February 1997.Google Scholar
  11. FIPS Pub 198, The Keyed-Hash Message Authentication Code (HMAC), March 2002.Google Scholar
  12. FIPS Pub 185, Escrowed Encryption Standard, February 9, 1994.Google Scholar
  13. FIPS Pub 186-2, Digital Signature Standard, January 2000.Google Scholar
  14. FIPS Pub 186-2 change notice, Digital Signature Standard, October 2001.Google Scholar
  15. FIPS 180-2, Secure Hash Standard (SHS), August 2002.Google Scholar
  16. FIPS PUB 140-2, Security Requirements for Cryptographic Modules, 2002.Google Scholar
  17. FIPS PUB 140-2, Security Requirements for Cryptographic Modules, Annex A: Approved Security Functions, Draft, 2005.Google Scholar
  18. FIPS PUB 140-2, Security Requirements for Cryptographic Modules, Annex B: Approved Protection Profiles, Draft, 2004.Google Scholar
  19. FIPS PUB 140-2, Security Requirements for Cryptographic Modules, Annex C: Approved Random Number Generators, Draft, 2005.Google Scholar
  20. FIPS PUB 140-2, Security Requirements for Cryptographic Modules, Annex D: Approved Key Establishment Techniques, Draft, 2005.Google Scholar
  21. R.K. Guy, Unsolved Problems in Number Theory, 3rd ed., Springer, New York, 2004.MATHGoogle Scholar
  22. R. Crandall and C. Pomerance, Prime Numbers, Springer, New York, 2001.Google Scholar
  23. Bill Gates, Road Ahead, 1995, Viking Publishers, p. 265.Google Scholar
  24. P. Ribenboim, P. “Twin Primes” Y 4.3 in The New Book of Prime Number Records, Springer, New York. 1996, pp. 259–265.Google Scholar
  25. FIPS Pub 46-3, Data Encryption Standard (DES), October 25, 1999.Google Scholar
  26. FIPS 197, Advanced Encryption Standard, November 26, 2001,Google Scholar
  27. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.Google Scholar
  28. http://csrc.nist.gov/encryption/aes//rijndeal/Rijndael.pdf.Google Scholar
  29. W. Diffie and M.E. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, vol. 13, November 1967, pp. 644–654.MathSciNetGoogle Scholar
  30. S. Wiesner, “Conjugate Coding”, Sigact News, vol. 15, no. 1, 1983, pp. 78–88; (original manuscript written circa 1970), 31.CrossRefGoogle Scholar
  31. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental Quantum Cryptography”, Journal of Cryptology, vol. 5, no. 1, 1992, pp. 3–28. Preliminary version in Advances in Cryptology—Eurocrypt ’90 Proceedings, May 1990, Springer, pp. 253–265.MATHCrossRefGoogle Scholar
  32. C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska, “Practical Quantum Oblivious Transfer”, Advances in Cryptology vert Crypto ’91 Proceedings, August 1991, Springer, pp. 351–366.Google Scholar
  33. G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, “A Quantum Bit Commitment Scheme Probably Unbreakable by Both Parties”, Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362–371.Google Scholar
  34. A.C. Phillips, Introduction to Quantum Mechanics, Wiley.Google Scholar
  35. J. Gruska, Quantum Computing, McGraw-Hill, London, 1999.Google Scholar
  36. C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska, “Practical Quantum Oblivious Transfer”, Advances in Cryptology vert Crypto ’91 Proceedings, August 1991, Springer, pp. 351–366.Google Scholar
  37. G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, “A Quantum Bit Commitment Scheme Provably Unbreakable by Both Parties”, Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362–371.Google Scholar
  38. H. Buhrman, R. Cleve, and A. Wigderson, “Quantum vs Classical Communication and Computation”, ACM Press, Proceedings of the 30th Annual ACM Symposium on the Theory pof Computation, El Paso, 1998, pp. 63–88.Google Scholar
  39. D. Deutch, “Quantum Computational Networks”, Proceedings of the Royal Society of London A, vol. 425, 1989, pp. 73–90.Google Scholar
  40. N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, “Quantum Cryptography”, Review of Modern Physics, vol. 74, 2002, pp. 145–195.CrossRefGoogle Scholar
  41. S. Kartalopoulos, “All-Optical XOR Gate for Quantum Ciphertext in Optical Communications”, Proceedings of SPIE Defense and Security, September 26–29, 2005, Bruges, Belgium, paper no 5989A-14, on CD-ROM: CDS191.Google Scholar
  42. S. Kartalopoulos, “Cascadable All-Optical XOR Gates for Optical Ciphertext and Parity Calculations”, Proceedings of SPIE Optics and Optoelectronics 2007, April 16–20, 2007, Prague, Chech Rep., on CD-ROM, vol. 6581–6588.Google Scholar
  43. A. Shamir, How to Share a Secret, Communications of the ACM, vol. 22, no. 11, 1979, pp. 612–613.MATHCrossRefMathSciNetGoogle Scholar
  44. W. Diffie and M.E. Hellman, “New directions in Cryptography”, IEEE Transactions on Information Theory, vol. IT-22, 1976, pp. 644–654.CrossRefMathSciNetGoogle Scholar
  45. N. Koblitz, Elliptic Curves Cryptosystems. Mathematics of Computation, vol. 48, 1987, pp. 203–209.MATHCrossRefMathSciNetGoogle Scholar
  46. V.S. Miller, “Uses of Elliptic Curves in Cryptography”, Advances in Cryptology CRYPTO’85, Lecture Notes in Computer Science, vol. 218, Springer, 1986, pp. 417–426.Google Scholar
  47. N. Koblitz, Introduction to Elliptic Curves and Modular Forms. Graduate Texts in Mathematics, No. 97, 2nd ed., Springer, New York, 1993.Google Scholar
  48. N. Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, vol. 3, Springer, New York, 1998.Google Scholar
  49. D. Hankerson, A. Menezes, and S.A. Vanstone, Guide to Elliptic Curve Cryptography, Springer, 2004.Google Scholar
  50. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, London Mathematical Society 265, Cambridge University Press, 1999.Google Scholar
  51. Blake, G. Seroussi, and N. Smart, (ed.), Advances in Elliptic Curve Cryptography, London Mathematical Society 317, Cambridge University Press, 2005.Google Scholar
  52. L. Washington, Elliptic Curves: Number Theory and Cryptography, Chapman & Hall/CRC, 2003.Google Scholar
  53. N. Koblitz, A. Menezes, and S. Vanstone, “The State of Elliptic Curve Cryptography”, Design, Codes and Cryptography, vol. 18, 2000, pp. 173–193.CrossRefMathSciNetGoogle Scholar
  54. A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer, 1993.Google Scholar
  55. A. Menezes,Elliptic Curve Cryptosystems, CryptoBytes, vol.1, no.2, Summer 1995.Google Scholar
  56. V. Mueller, A. Stein, and C. Thiel, “Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus”, Mathematics of Computation, vol. 68, 1999, pp. 807–822.MATHCrossRefMathSciNetGoogle Scholar
  57. I. Biehl, B. Meyer, and V. Müller, “Differential Fault Analysis on Elliptic Curve Cryptosystems”, Advances in Cryptology—CRYPTO 2000, Lecture Notes in Computer Science 1880, pp. 131–146.Google Scholar
  58. C. Lim and P. Lee, “A Key Recovery Attack on Discrete Log-Based Schemes Using a Prime Order Subgroup”, Advances in Cryptology—CRYPTO 97, Lecture Notes in Computer Science 1294, pp. 249–263.Google Scholar
  59. N. Demytko, A New Elliptic Curve Based Analogue of RSA, Advances in Cryptology, Eurocrypt’93, pp. 40–49, Springer, 1994.Google Scholar
  60. H.W. Lenstra, Jr. Factoring Integers with Elliptic Curves. Annals of Mathematics, vol. 126, 1987, pp. 649–673.CrossRefMathSciNetGoogle Scholar
  61. A. Menezes, T. Okamoto, and S.A. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 80–89, ACM, 1991.Google Scholar
  62. V.S. Miller, Use of Elliptic Curve in Cryptography, Advances in Cryptology, Crypto’85, pp. 417–426, Springer, 1986.Google Scholar
  63. P. Fahn and M.J.B. Robshaw. Results from the RSA Factoring Challenge. Technical Report TR-501, version 1.3, RSA Laboratories, January 1995.Google Scholar
  64. R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications of the ACM, vol. 21, no. 2, February 1978, pp. 120–126.MATHCrossRefMathSciNetGoogle Scholar
  65. T. ElGamal. “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms”, IEEE Transactions on Information Theory, vol. IT-31, 1985, pp. 469–472.CrossRefMathSciNetGoogle Scholar
  66. FIPS PUB 186: Digital Signature Standard, May 19, 1994.Google Scholar
  67. C.H. Bennett, and G. Brassard, “An Update on Quantum Cryptography”, Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer, pp. 475–480.Google Scholar
  68. I. Stewart, “Schrodinger’s Catflap”, Nature, vol. 353, October 3, 1991, pp. 384–385.CrossRefGoogle Scholar
  69. C. Crépeau, “Cryptographic Primitives and Quantum Theory”, Proceedings of Workshop on Physics and Computation, PhysComp 92, Dallas, October 1992, pp. 200–204.Google Scholar
  70. P. Wallich, “Quantum Cryptography”, Scientific American, May 1989, pp. 28–30.Google Scholar
  71. C.H. Bennett, “Quantum Cryptography: Uncertainty in the Service of Privacy”, Science, vol. 257, August 7, 1992, pp. 752–753.CrossRefGoogle Scholar
  72. R. Clifton, J. Bud, and H. Halvorson, “Characterizing Quantum Theory in Terms of Information-Theoretic Constraints” Foundations of Physics, vol. 33, 2003, pp. 1561–1591.CrossRefMathSciNetGoogle Scholar
  73. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.MATHGoogle Scholar
  74. C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska, “Practical Quantum Oblivious Transfer”, Advances in Cryptology vert Crypto ’91 Proceedings, August 1991, Springer, pp. 351–366.Google Scholar
  75. G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, “A Quantum Bit Commitment Scheme Provably Unbreakable by Both Parties”, Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362–371.Google Scholar
  76. S. Wiesner, “Conjugate Coding”, Sigact News, vol. 15, no. 1, 1983, pp. 78–88; original manuscript written circa 1970.CrossRefGoogle Scholar
  77. A.K. Ekert, “Quantum Cryptography based on Bell’s Theorem”, Physical Review Letters, vol. 67, no. 6, August 5, 1991, pp. 661–663.CrossRefMathSciNetGoogle Scholar
  78. P.D. Townsend and I. Thompson, “A Quantum Key Distribution Channel Based on Optical Fibre”, Journal of Modern Optics, vol 41, no 12, December 1994, pp. 2425–2434.CrossRefGoogle Scholar
  79. S.V. Kartalopoulos, DWDM: Networks, Devices and Technology, IEEE/Wiley, 2003.Google Scholar
  80. C.H. Bennett, “Quantum Cryptography Using Any Two Nonorthogonal States”, Physical Review Letters, vol. 68, no. 21, May 25, 1992, pp. 3121–2124.CrossRefGoogle Scholar
  81. A. Muller, J. Breguet, and N. Gisin, “Experimental Demonstration of Quantum Cryptography Using Polarized Photons in Optical Fibre over more than 1 km” Europhysics Letters, vol. 23, no. 6, August 20, 1993, pp.383–388.CrossRefGoogle Scholar
  82. C.H. Bennett and G. Brassard, “Quantum Cryptography: Public-Key Distribution and Coin Tossing”, Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984, pp. 175–179, and also “Quantum Public Key Distribution System”, IBM Technical Disclosure Bulletin, vol. 28, no. 7, December 1985, pp. 3153–3163.Google Scholar
  83. J.D. Franson and H. Ilves, “Quantum Cryptography Using Polarization Feedback”, Journal of Modern Optics, vol 41, no 12, December 1994, pp. 2391–2396.MATHCrossRefMathSciNetGoogle Scholar
  84. B. Huttner and A. Peres, “Quantum Cryptography with Photon Pairs”, Journal of Modern Optics, vol 41, no 12, December 1994, pp. 2397–2404.MATHCrossRefMathSciNetGoogle Scholar
  85. A.K. Ekert, J.G. Rarity, P.R. Tapster, and G.M. Palma, “Practical Quantum Cryptography Based on Two-Photon Interferometry”, Physical Review Letters, vol. 69, no. 9, 31 August 1992, pp. 1293–1295.CrossRefGoogle Scholar
  86. S.M. Barnett, B. Huttner, and S.J.D. Phoenix, “Eavesdropping Strategies and Rejected-Data Protocols in Quantum Cryptography”, Journal of Modern Optics, vol. 40, no. 12, December 1993, pp. 2501–2513.CrossRefGoogle Scholar
  87. D. Deutsch, “Quantum Communication Thwarts Eavesdroppers”, New Scientist, December 9, 1989, pp. 25–26.Google Scholar
  88. G.P. Collins, “Quantum Cryptography Defies Eavesdropping”, Physics Today, November 1992, pp. 21–23.Google Scholar
  89. A.K. Ekert, “Quantum Keys for Keeping Secrets”, New Scientist, 16, January 1993, pp. 24–28.Google Scholar
  90. P.D. Townsend and S.J.D. Phoenix, “Quantum Mechanics Will Protect Area Networks”, Opto and Laser Europe, July 1993, pp. 17–20.Google Scholar
  91. C.H. Bennett, G. Brassard, S. Breidbart, and S. Wiesner, “Eavesdrop-Detecting Quantum Communications Channel”, IBM Technical Disclosure Bulletin, vol. 26, no. 8, January 1984, pp. 4363–4366.Google Scholar
  92. S.V. Kartalopoulos, “Is Optical Quantum Cryptography the “Holly Grail” of secure communication?”, SPIE Newsroom Magazine, April 2006, available at http://newsroom.spie.org/x2260.xml?highlight = x537.Google Scholar
  93. J.G. Rarity, P.C.M. Owens, and P.R. Tapster, “Quantum Random Number Generation and Key Sharing”, Journal of Modern Optics, vol. 41, no. 12, December 1994, pp. 2435–2444.CrossRefGoogle Scholar
  94. E. Schroedinger, “Discussion of Probability Relations Between Separated Systems”, Proceedings of the Cambridge Philosophical Society, vol. 31, 1935, pp. 555–563.MATHCrossRefGoogle Scholar
  95. E. Schroedinger, “Discussion of Probability Relations Between Separated Systems”, Proceedings of the Cambridge Philosophical Society, vol. 32, 1936, pp. 446–451.Google Scholar
  96. A. Einstein, B. Podolsky, and N. Rosen, “Can Quantum-Mechanical Description of Physical Reality be considered complete?”, Physical Review, vol. 47, 1935, pp. 777–780. Reprinted in Quantum Theory and Measurement (J.A. Wheeler and W.Z. Zurek, eds.), Princeton University Press, 1983.MATHCrossRefGoogle Scholar
  97. J.S. Bell, “On the Einstein–Podolsky–Rosen Paradox”, Physics, vol. 1, 1964, pp. 195–200.Google Scholar
  98. J.F. Sherson, H. Krauter, R.K. Olsson, B. Julsgaard, K. Hammerer, I. Cirac, and E.S. Polzik, “Quantum Teleportation Between Light and Matter”, Nature, vol. 443, October 5, 2006, pp. 557–560.CrossRefGoogle Scholar
  99. C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W.K. Wootters, Teleporting an Unknown Quantum State via Dual Classical and Einstein–Podolsky–Rosen Channels, Physics Review Letters, vol. 70, 1993, pp. 1895–1899.MATHGoogle Scholar
  100. G. Brassard, S. Braunstein, and R. Cleve, Teleportation as a Quantum Computation, Physica D vol. 120, 1998, pp. 43–47.MATHMathSciNetGoogle Scholar
  101. G. Rigolin, Quantum Teleportation of an Arbitrary Two Qubit State and Its Relation to Multipartite Entanglement, Phys. Rev. A, vol. 71, 2005, 032303.CrossRefGoogle Scholar
  102. L. Vaidman, Teleportation of Quantum States, Physics Review. A, 1994.Google Scholar
  103. D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, and A. Zeilinger, “Experimental Quantum Teleportation”, Nature vol. 390, 6660, 1997, pp. 575–579.CrossRefGoogle Scholar
  104. D. Boschi, S. Branca, F. De Martini, L. Hardy, and S. Popescu, “Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein–Podolsky–Rosen channels”, Physics Review Letters, 80, 6, 1998, pp. 1121–1125.MATHCrossRefGoogle Scholar
  105. I. Marcikic, H. de Riedmatten, W. Tittel, H. Zbinden, and N. Gisin, “Long-Distance Teleportation of Qubits at Telecommunication Wavelengths”, Nature, vol. 421, 2003, p. 509.CrossRefGoogle Scholar
  106. R. Ursin et al., “Quantum Teleportation Link Across the Danube”, Nature, vol. 430, 2004, p. 849.CrossRefGoogle Scholar
  107. D. Gottesman and I. Chuang, “Teleportation as a Computational Primitive”, Nature, vol. 402, 1999, pp. 390–393.CrossRefGoogle Scholar
  108. L. Vaidman, Using Teleportation to Measure Nonlocal Variables, quant-ph/0111124.Google Scholar
  109. Thomas D. Angelidis, “On the Problem of a Local Extension of the Quantum Formalism”, Journal of Mathematical Physics, vol. 34, 1993, p. 1635.CrossRefMathSciNetGoogle Scholar
  110. Thomas D. Angelidis, “A Minimal Local Extension of the Quantum Formalism” in Causality and Locality in Modern Physics, Kluwer, 1998, pp. 451–462.Google Scholar
  111. Alain Aspect et al., “Experimental Tests of Bell’s Inequalities Using Time-Varying Analyzers”, Physics Review Letters, vol. 49, 1982, pp. 1804–1807.CrossRefGoogle Scholar
  112. John Bell, Speakable and Unspeakable in Quantum Mechanics (collected papers on quantum philosophy), Cambridge University Press, 1987.Google Scholar
  113. Mark Buchanan, “Quantum Teleportation”, New Scientist, March 14, 1998.Google Scholar
  114. A. Poppe et al., “Practical Quantum Key Distribution with Polarization Entangled Photons”, Optics Express, vol. 12, no. 16, 2004, pp. 3865–3871.CrossRefGoogle Scholar
  115. http://arxiv.org/archive/quant-ph. This is an excellent archive of published quantum related papers.Google Scholar
  116. D.R. Kuhn, “Vulnerabilities in Quantum Key Distribution Protocols”, quant-ph/0305076, May 12, 2003.Google Scholar
  117. S.V. Kartalopoulos, “Link-Layer Vulnerabilities of Quantum Cryptography”, SPIE International Congress on Optics and Optoelectronics, Warsaw, Poland, August 28, 2005 to September 2, 2005, Proceedings of SPIE, vol. 5954, pp. 5954OH-1 to 5954OH-7.Google Scholar
  118. S.V. Kartalopoulos, “Identifying Vulnerabilities of Quantum Cryptography in Secure Optical Data Transport”, Unclassified Proceedings of Milcom 2005, October 17–20, 2005, Atlantic City, session: Comm. Security I, invited paper # 678, on CD-ROM, ISBN # 0-7803-9394-5Google Scholar
  119. S.V. Kartalopoulos, “Secure Optical Links in the Next-Generation DWDM Optical Networks”, WSEAS Transactions on Communications, vol. 3, no. 2 April 2004, pp. 456–459 (ISSN 1109–2742). Also, presented at ICCC’04, WSEAS 8th International Conference on Communications and Computers, International Workshop on Cryptography, Vouliagmeni, Athens, Greece, July 12–15, 2004.Google Scholar
  120. S.V. Kartalopoulos, “Optical Network Security: Sensing Eavesdropper Intervention”, Globecom 2006, San Francisco.Google Scholar
  121. S.V. Kartalopoulos, “Optical Network Security: Countermeasures in View of Channel Attacks”, Unclassified Proceedings of Milcom 2006, October 23–25, 2006, Washington, DC, on CD-ROM, ISBN 1-4244-0618-8, Library of Congress 2006931712, paper no. US-T-G-404.Google Scholar
  122. S.V. Kartalopoulos, “Optical Network Security: Countermeasures in View of Attacks”, Proceedings of SPIE European Symposium on Optics and Photonics in Security and Defense, Stockholm, Sweden, September 11–16, 2006, on CD-ROM, paper no. 6402-9; also in SPIE Digital Library at http://spiedl.orgGoogle Scholar
  123. S.V. Kartalopoulos, “Per-Port Circuit for Statistical Estimation of Bit Error Rate and Optical Signal to Noise Ratio in DWDM Telecommunications”, Proceedings of the SPIE Conference on Fluctuation and Noise, May 25–28, Las Palmas, Gran Canaria, Spain, 2004, pp. 131–141.Google Scholar
  124. S.V. Kartalopoulos, “Distinguishing Between Network Intrusion and Component Degradations in Optical Systems and Networks”, WSEAS Transactions on Communications, vol. 4, no. 9, September 2005, pp. 1154–1161.Google Scholar
  125. S.V. Kartalopoulos, “Factors Affecting the Signal Quality, and Eye-Diagram Estimation Method for BER and SNR in Optical Data Transmission”, Proceedings of the International Conference on Information Technology, ITCC-2004, Las Vegas, April 5–7, 2004, pp. 615–619.Google Scholar
  126. S.V. Kartalopoulos, “Optical Network Security: Channel Signature ID”, Unclassified Proceedings of Milcom 2006, October 23–25, 2006, Washington, DC, on CD-ROM, ISBN 1-4244-0618-8, Library of Congress 2006931712, paper no. US-T-G-403.Google Scholar
  127. S.V. Kartalopoulos, Fault Detectability in DWDM: Towards Higher Signal Quality and Network Reliability, IEEE Press, New York, NY, 2001.Google Scholar
  128. S.V. Kartalopoulos, Optical Bit Error Rate, IEEE Press/Wiley, New York, NY, 2004.Google Scholar
  129. D. Marcuse, “Derivation of Analytical Expressions for the Bit-Error Probability in Lightwave Systems with Optical Amplifiers”, Journal of Lightwave Technology, vol. 8, no. 12, 1990, pp. 1816–1823.CrossRefGoogle Scholar
  130. M.D. Knowles and A.I. Drukarev, “Bit Error Rate Estimation for Channels with Memory”, IEEE Transactions on Communications, vol. 36, no. 6, 1988, pp. 767–769.CrossRefGoogle Scholar
  131. S.V. Kartalopoulos, “Communications Security: Biometrics over Communications Networks”, Proceedings of IEEE Globecom 2006 Conference, San Francisco, CA.Google Scholar
  132. S.V. Kartalopoulos, Next Generation SONET/SDH, IEEE Press/Wiley, New York, NY, 2004.Google Scholar
  133. ITU-T Recommendation G.709/Y.1331, “Interfaces for the Optical Transport Network (OTN)”, February 2001.Google Scholar
  134. ITU-T Recommendation G.709/Y.1331, “Interfaces for the Optical Transport Network (OTN), Amendment 1”, February 2001.Google Scholar
  135. ITU-T Recommendation G.709/Y.1331, Amendment 1, “Amendment 1”, November 2001.Google Scholar
  136. ITU-T Draft Recommendation G.798, “Characteristics of Optical Transport Networks (OTN) Equipment Functional Blocks”, October 1998.Google Scholar
  137. ITU-T Recommendation G.805, “Generic Functional Architecture of Transport Networks”, October 1998.Google Scholar
  138. ITU-T Recommendation G.872, “Architecture of Optical Transport Networks”, November 2001.Google Scholar
  139. ITU-T Draft Recommendation G.873, “Optical Transport Network Requirements”, October 1998.Google Scholar
  140. ITU-T Draft Recommendation G.874, “Management Aspects of the Optical Transport Network Element”, October 1998.Google Scholar
  141. ITU-T Draft Recommendation G.875, “Optical Transport Network Management Information Model for the Network Element View”, October 1998.Google Scholar
  142. ITU-T Recommendation G.957, “Optical Interfaces for Equipments and Systems Relating to the Synchronous Digital Hierarchy”, 1995.Google Scholar
  143. ITU-T Draft Recommendation G.959, “Optical Networking Physical Layer Interfaces”, February 1999.Google Scholar
  144. ITU-T Recommendation G.8251, “The Control of Jitter and Wander Within the Optical Transport Network (OTN)”, November 2001.Google Scholar
  145. ITU-T Recommendation X.85/Y.1321, “IP over SDH Using LAPS”, March 2001.Google Scholar
  146. ITU-T Recommendation X.86, “Ethernet over LAPS”, February 2001.Google Scholar
  147. ITU-T Recommendation G.7041/Y.1303, “The Generic Framing Procedure (GFP) Framed and Transparent”, December 2001.Google Scholar
  148. E. Hernandez-Valencia, M. Scholten, and Z. Zhu, “The Generic Framing Procedure (GFP): An Overview”, IEEE Communications Magazine, vol. 40, no. 5, May 2002, pp. 63–71.CrossRefGoogle Scholar
  149. E. Hernandez-Valencia, “Generic Framing Procedure (GFP): A Next-Generation Transport Protocol for High-Speed Data Networks”, Optical Networks Magazine, vol. 4, no. 1, January/February 2003, pp. 59–69.Google Scholar
  150. M. Scholten, Z. Zhu, E. Hernandez-Valencia, and J. Hawkins, “Data Transport Applications Using GFP”, IEEE Communications Magazine, vol. 40, no. 5, May 2002, pp. 96–103.CrossRefGoogle Scholar
  151. ITU-T Recommendation G.7042/Y.1305, “Link Capacity Adjustment Scheme (LCAS) for Virtual Concatenated Signals”, November 2001.Google Scholar
  152. ITU-T Recommendation X.86/Y.1323, Amendment 1, “Ethernet over LAPS, Amendment 1: Using Ethernet Flow Control as Rate Limiting”, April 2002.Google Scholar
  153. S.V. Kartalopoulos, “Bandwidth Elasticity with DWDM Parallel Wavelength-Bus in Optical Networks”, SPIE Optical Engineering, vol. 43, no. 5, May 2004, pp. 1092–1100.Google Scholar
  154. S.V. Kartalopoulos, “Parallel WDM Transmission for Ultra-high Bandwidth Remote Computer Communication”, WSEAS Transactions on Communications, vol. 1, no. 1 July 2004, pp. 99–102, (ISSN 1790-0832).Google Scholar
  155. S.V. Kartalopoulos, “DNA-Inspired Cryptographic Methods in Optical Communications, Source Authentication and Data Mimicking”, Unclassified Proceedings of Milcom 2005, October 17–20, 2005, Atlantic City, session: Comm. Security II, invited paper # 1470, on CD-ROM, ISBN # 0-7803-9394-5.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Stamatios V. Kartalopoulos
    • 1
  1. 1.The University of OklahomaTulsaUSA

Personalised recommendations