References
- Zhao Y. Quantum cryptography in real-life applications: assumptions and security [dissertation Ph.D]. The University of Toronto, CAN; 2009.
- Vaudenay S. Secure communications over insecure channels based on short authenticated strings. In: Shoup V, editor. Advances in cryptology – CRYPTO 2005. CRYPTO 2005. lecture notes in computer science. Vol. 3621. Berlin, Heidelberg: Springer; 2005. doi:10.1007/11535218_19.
- Gupta I, Narain L, Veni Madhavan CE. Cryptological applications of permutation polynomials. Electron Notes Dis Mathemat. 2003;15:91.
- Gabidulin EM, Ourivski AV, Honary B, et al. Reducible rank codes and their applications to cryptography. IEEE Trans Inf Theory. 2003;49(12):3289–3293.
- Qadir AM, Varol N. A review paper on cryptography. 2019 7th International Symposium on Digital Forensics and Security (ISDFS). 2019. p. 1–6. DOI:10.1109/isdfs.2019.8757514.
- Sharbaf MS. Quantum cryptography: an emerging technology in network security. 2011 IEEE International Conference on Technologies for Homeland Security (HST), Waltham, MA; 2011. p. 13–19. DOI: 10.1109/THS.2011.6107841.
- Cruz B, Domingo K, Guzman F, et al.. Expanded 128-bit data encryption standard. 2017. DOI: 10.13140/RG.2.2.36392.72969.
- Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM. 1978;21(2):120–126.
- Nielsen MA, Chuang IL. Quantum computation and quantum information. Cambridge: Cambridge University Press; 2000.
- Glos A, Miszczak JA. Impact of the malicious input data modification on the efficiency of quantum spatial search. Quantum Inf Process. 2019;18:343.
- Boneh D, Twenty years of attacks on the RSA cryptosystem, Notices of the American Mathematical Society (AMS) 2002;46:3.
- Shor PW. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 1999;41(2):303–332.
- Ekert A, Jozsa R. Quantum computation and Shor’s factoring algorithm. Rev Mod Phys. 1996;68(3):733–753.
- Jain S. Quantum computer architectures: A survey. 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi; 2015. p. 2165–2169.
- Shorter RS. Quantum physics: what everyone needs to know. Contemp Phys. 2018;59(4):410.
- RSA (cryptosystem) - wikipedia article - section 6: security and practical considerations.
- Aggarwal D, Maurer U. Breaking RSA generically is equivalent to factoring. In: editor, Joux A. Advances in cryptology - EUROCRYPT 2009. Lecture notes in computer science. Vol. 5479. Berlin, Heidelberg: Springer; 2009:36–53
- Hossain A Md., Hossai U Md, Imtiaz S Md. Performance analysis of different cryptography algorithms. Inter J Adv Res Com Sci Soft Eng. 2016;6:659–665
- Wang Y, Yan S, Zhang H. A new quantum algorithm for computing the RSA ciphertext period. Wuhan Univ J Nat Sci. 2017;22. 68–72. DOI:10.1007/s11859-017-1218-5.
- Fowler AG, Devitt SJ, Hollenberg LCL. Implementation of Shor’s algorithm on a linear nearest neighbour qubit array. Quant Info Comput. 2004;4:237–251.
- Imre S. Quantum computing and communications – introduction and challenges. Comput Electr Eng. 2014;40(1):134–141.
- Gong X, Socolar JES. Quantifying the complexity of random Boolean networks. Phys Rev. 2012;85(6). DOI:10.1103/physreve.85.066107
- Alicki R, Horodecki M, Horodecki P, et al. Dynamical description of quantum computing: generic nonlocality of quantum noise. Phys Rev A. 2002;65(6). DOI:10.1103/physreva.65.062101
- Bernstein DJ. Introduction to post-quantum cryptography. In: Bernstein DJ, Buchmann J, Dahmen E, editors. Post-Quantum Cryptography. Berlin, Heidelberg: Springer; 2009:1–14.
- Introduction to the D-Wave Quantum Hardware. [cited Oct 2018]. https://www.dwavesys.com/tutorials/background-reading-series/introduction-d-wave-quantum-hardware