Openly accessible

Fast and simple high-capacity quantum cryptography with error detection

Lai, Hong, Luo, Ming-Xing, Pieprzyk, Josef, Zhang, Jun, Pan, Lei, Li, Shudong and Orgun, Mehmet A. 2017, Fast and simple high-capacity quantum cryptography with error detection, Scientific reports, vol. 7, pp. 1-11, doi: 10.1038/srep46302.

Attached Files
Name Description MIMEType Size Downloads
zhang-fastand-2017.pdf Published version application/pdf 490.39KB 86

Title Fast and simple high-capacity quantum cryptography with error detection
Author(s) Lai, Hong
Luo, Ming-Xing
Pieprzyk, Josef
Zhang, JunORCID iD for Zhang, Jun orcid.org/0000-0002-2189-7801
Pan, LeiORCID iD for Pan, Lei orcid.org/0000-0002-4691-8330
Li, Shudong
Orgun, Mehmet A.
Journal name Scientific reports
Volume number 7
Article ID 46302
Start page 1
End page 11
Total pages 11
Publisher Nature Publishing Company
Place of publication London, Eng.
Publication date 2017-04
ISSN 2045-2322
Keyword(s) Science & Technology
Multidisciplinary Sciences
Science & Technology - Other Topics
ORBITAL ANGULAR-MOMENTUM
PHOTONS
STATES
Summary Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.
Language eng
DOI 10.1038/srep46302
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2017, The Authors
Free to Read? Yes
Use Rights Creative Commons Attribution licence
Persistent URL http://hdl.handle.net/10536/DRO/DU:30094320

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 4 times in TR Web of Science
Scopus Citation Count Cited 5 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 357 Abstract Views, 87 File Downloads  -  Detailed Statistics
Created: Wed, 26 Apr 2017, 11:13:03 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.