CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

The Goals of Parity Bits in Quantum Key Distribution System

by Omer Abd Alkareem Jasim, Anas Ayad Abdulrazzaq
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 18
Year of Publication: 2012
Authors: Omer Abd Alkareem Jasim, Anas Ayad Abdulrazzaq
10.5120/8997-2281

Omer Abd Alkareem Jasim, Anas Ayad Abdulrazzaq . The Goals of Parity Bits in Quantum Key Distribution System. International Journal of Computer Applications. 56, 18 ( October 2012), 5-9. DOI=10.5120/8997-2281

@article{ 10.5120/8997-2281,
author = { Omer Abd Alkareem Jasim, Anas Ayad Abdulrazzaq },
title = { The Goals of Parity Bits in Quantum Key Distribution System },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 18 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number18/8997-2281/ },
doi = { 10.5120/8997-2281 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:59:09.506798+05:30
%A Omer Abd Alkareem Jasim
%A Anas Ayad Abdulrazzaq
%T The Goals of Parity Bits in Quantum Key Distribution System
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 18
%P 5-9
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The basic foundation behind cryptography as a discipline was to research how valuable data, information can be protected from unauthorized parties, such as adversaries. Quantum cryptography is one of the recent advancement occurred within that discipline. However, this cryptographic algorithm still at its early stages, where there is no wide implementation can be seen. Many research papers have been done to develop this algorithm, while others, to propose new implementations of this algorithm to tackle a specific problem. This research paper studies and examines the relationship between the QKDS (Quantum Key Distribution System) and the parity bits. Hence, explore how the use of parity bits can improve the final resolved key.

References
  1. Muhammad Musharraf Ishtiaq Khan, "Protocols for Secure Quantum Transmission: A Review of Recent Developments", Pakistan Journal of Information andTechnology 2 (3): 265-276, 2003, ISSN 1682-6027.
  2. Nicolas Gisin, GregoireRibordy, Wolfgang Tittel, and Hugo Zbinden , "Quantum Cryptography", REVIEWS OF MODERN PHYSICS, VOLUME 74, JANUARY 2002 , pp. 145 – 195.
  3. Matt Blumenthal , "Encryption: Strengths and Weaknesses of Public-key Cryptography ", Proceedings of the 1st Villanova University Computer Science Research Symposium , 2007.
  4. Branciard, Cyril; Gisin, Nicolas; Kraus, Barbara; Scarani, Valerio, "Security of two quantum cryptography protocols using the same four qubit states". Physical Review, 2005, A 72 (3).
  5. N. Axvig, K. Morrison, E. Psota, D. Dreher, L. C. P erez, and J. L. Walker, " ? Analysis of connections between pseudocodewords" , IEEE Transactions on Information Theory, vol. IT-55, no. 9, pp. 4099–4107, September 2009.
  6. P. O. Vontobel, "Symbolwise graph-cover decoding: Connecting sum- product algorithm decoding and bethe free energy minimization", in Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing, September 2008.
  7. D. Changyan, D. Proetti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure - channel," IEEE Transactions on Information Theory, vol. 48, pp. 1570–1579, June 2002.
  8. Ergün GÜMÜ? and CRYPTOGRAPHY AND DISTRIBUTION G. Zeynep AYDIN M. Ali AYDIN, "quantum comparison of quantum protocols", STANBUL UNIVERSITY, 2008 KEY (503-510) , JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING VOLUME: 8.
  9. Vittorio, S. , "Quantum Cryptography: Privacy Through Uncertainty" , 2002, http://www. csa. com/discoveryguides/crypt/overview. php
  10. Id Quantique White Paper, "Understanding Quantum ", 2005, http://www. idquantique. com/products/files/vectis-understanding. pdf
  11. Chip Elliott, David Pearson, MAGregoryTroxel, "Quantum Cryptography in Practice", Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, ACM NY, 2003, pp. 227-238.
  12. MatteoMariantoni, H. Wang, T. Yamamoto, M. Neeley, Radoslaw C. Bialczak, Y. Chen, M. Lenander, Erik Lucero, A. D. O'Connell, D. Sank, M. Weides, J. Wenner, Y. Yin, J. Zhao, A. N. Korotkov, A. N. Cleland, John M. Martinis, "Implementing the Quantum von Neumann Architecture with Superconducting Circuits", Cornel University Library, Journal Reference:Science 334, 61-65 (2011).
  13. F. T. Sufyan and K. Jasim. Omer , "Reducing theAuthentication bits lost in Quantum Cryptography", The International Conference on Digital Information and Communication Technology and its Applications (PGNET'2011) , Jemors University , Liverpool.
  14. PETER SELINGER , "Towards a Quantum Programming Language ", Math. Struct. in Comp. Science 14(4):527-586, 2004 .
Index Terms

Computer Science
Information Sciences

Keywords

Quantum Cryptography parity bits BB84 protocol simulation QKDS

Powered by PhDFocusTM