{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T01:06:11Z","timestamp":1778634371140,"version":"3.51.4"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003471","name":"Harbin Engineering University, Heilongjiang, China","doi-asserted-by":"publisher","award":["HEUCFG201712"],"award-info":[{"award-number":["HEUCFG201712"]}],"id":[{"id":"10.13039\/501100003471","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003471","name":"Harbin Engineering University, Heilongjiang, China","doi-asserted-by":"publisher","award":["3072019CFJ0518"],"award-info":[{"award-number":["3072019CFJ0518"]}],"id":[{"id":"10.13039\/501100003471","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2995801","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T20:49:58Z","timestamp":1589921398000},"page":"99273-99285","source":"Crossref","is-referenced-by-count":38,"title":["A Lightweight Post-Quantum Lattice-Based RSA for Secure Communications"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6047-6882","authenticated-orcid":false,"given":"Iqra","family":"Mustafa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3268-4844","authenticated-orcid":false,"given":"Imran Ullah","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0908","authenticated-orcid":false,"given":"Sheraz","family":"Aslam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2829-0893","authenticated-orcid":false,"given":"Ahthasham","family":"Sajid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0886-9061","authenticated-orcid":false,"given":"Syed Muhammad","family":"Mohsin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7064-6796","authenticated-orcid":false,"given":"Muhammad","family":"Awais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2985-6120","authenticated-orcid":false,"given":"Muhammad Bilal","family":"Qureshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_15"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-019-01054-w"},{"key":"ref33","article-title":"Advances in quantum cryptography","author":"pirandola","year":"2019","journal-title":"arXiv 1906 01645"},{"key":"ref32","article-title":"Secure quantum key distribution with realistic devices","author":"xu","year":"2019","journal-title":"arXiv 1903 09051"},{"key":"ref31","article-title":"Simple untrusted network for quantum cryptography","year":"2008","journal-title":"Pearson David Spencer and Brig Barnum Elliott"},{"key":"ref30","article-title":"Method to support secure network booting using quantum cryptography and quantum key distribution","author":"zimmer","year":"2004"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-7998-1763-5.ch019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.10.008"},{"key":"ref35","article-title":"A brief survey of fully homomorphic encryption, computing on encrypted data","author":"lucas","year":"2016"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3292548"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/3.825881"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.145"},{"key":"ref29","article-title":"Free-space quantum cryptography system","author":"patterson","year":"2001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.11.022"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.11.031"},{"key":"ref20","article-title":"Post-quantum cryptographic communication protocol","author":"mustafa","year":"2019"},{"key":"ref22","first-page":"1","article-title":"Fast variants of RSA","volume":"5","author":"boneh","year":"2002","journal-title":"CryptoBytes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CONFLUENCE.2018.8442788"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_24"},{"key":"ref23","first-page":"1","article-title":"Quantum safe cryptography and security: An introduction, benefits, enablers and challenges","author":"campagna","year":"2015","journal-title":"European Telecommun Standards Inst"},{"key":"ref26","article-title":"Quantum cryptography multi-node network system","author":"nambu","year":"2002"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.IR.8105"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593098"},{"key":"ref51","first-page":"733","article-title":"Solving the shortest vector problem in 2 n time using discrete Gaussian sampling","author":"aggarwal","year":"2015","journal-title":"Proc 47th Annu ACM Symp Theory Comput"},{"key":"ref54","first-page":"21","author":"bornemann","year":"2018","journal-title":"Matrix Factorization In Numerical Linear Algebra"},{"key":"ref53","author":"voulgaris","year":"0","journal-title":"Gauss Sieve Beta 0 1 2010"},{"key":"ref52","year":"0"},{"key":"ref10","author":"bos","year":"2009","journal-title":"On the security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813707"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_18"},{"key":"ref13","article-title":"Key establishment àla merkle in a quantum world","author":"brassard","year":"2011","journal-title":"arXiv 1108 2316"},{"key":"ref14","article-title":"Getting post-quantum crypto algorithms ready for deployment","author":"g\u00e4neysu","year":"2020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.05.025"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7"},{"key":"ref17","article-title":"Quantum cryptography—Current methods and technology","author":"goldman","year":"2014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0146-3_42"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2993411"},{"key":"ref6","author":"ekert","year":"2010","journal-title":"Quantum cryptoanalysis—-Introduction"},{"key":"ref5","author":"boukhonine","year":"1998","journal-title":"Cryptography A Security Tool of the Information Age"},{"key":"ref8","first-page":"55","article-title":"Factoring estimates for a 1024-bit RSA modulus","volume":"2894","author":"lenstra","year":"2003","journal-title":"Advances in Cryptology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4192\/1577-8517-v19_5"},{"key":"ref49","first-page":"147","article-title":"Lattice-based cryptography","author":"micciancio","year":"2005","journal-title":"Post-Quantum Cryptography"},{"key":"ref9","author":"stevens","year":"2015","journal-title":"Freestart Collision on Full SHA-1 IACR Cryptology ePrint Archive 2015\/967"},{"key":"ref46","article-title":"Introduction to normed vector spaces","author":"terras","year":"2009"},{"key":"ref45","article-title":"Primitive vectors and SLn","author":"conrad","year":"0"},{"key":"ref48","first-page":"685","article-title":"Solving shortest and closest vector problems: The decomposition approach","volume":"2013","author":"becker","year":"2013","journal-title":"IACR Cryptology ePrint"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4980-7_2"},{"key":"ref42","article-title":"Quantum cryptography device and method","author":"gisin","year":"2002"},{"key":"ref41","first-page":"530","article-title":"Practical lattice-based cryptography: A signature scheme for embedded systems","author":"guneysu","year":"2012","journal-title":"Proc Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_10"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.119"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09096276.pdf?arnumber=9096276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:11Z","timestamp":1639770731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9096276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2995801","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}