{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:00:32Z","timestamp":1764403232416,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001315","name":"University of Hertfordshire","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001315","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11227-023-05115-4","type":"journal-article","created":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T08:03:32Z","timestamp":1678262612000},"page":"12219-12237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["CryptoQNRG: a new framework for evaluation of cryptographic strength in quantum and pseudorandom number generation for key-scheduling algorithms"],"prefix":"10.1007","volume":"79","author":[{"given":"A.","family":"Saini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tsokanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Kirner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"key":"5115_CR1","volume-title":"Cryptography and network security: principles and practices","author":"W Stallings","year":"2005","unstructured":"Stallings W (2005) Cryptography and network security: principles and practices. Pearson, New York"},{"key":"5115_CR2","doi-asserted-by":"publisher","unstructured":"Verma K, Sharma DK (2017) Calculation of non-linearity and algebraic degree of constructed boolean function. In: 2nd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT), pp 501\u2013505. https:\/\/doi.org\/10.1109\/RTEICT.2017.8256647","DOI":"10.1109\/RTEICT.2017.8256647"},{"key":"5115_CR3","doi-asserted-by":"publisher","unstructured":"Shi FL, Bin H (2010) Propagation properties of symmetric Boolean functions. In: International Conference on Intelligent Computation Technology and Automation, pp 947\u2013950. https:\/\/doi.org\/10.1109\/ICICTA.2010.614","DOI":"10.1109\/ICICTA.2010.614"},{"key":"5115_CR4","doi-asserted-by":"crossref","unstructured":"Biryukov A, Khovratovich D (2009) Related-key cryptanalysis of the full AES-192 and AES-256. In: Advances in Cryptology\u2014ASIACRYPT Lecture Notes in Computer Science. Springer, Berlin, pp 1\u201318","DOI":"10.1007\/978-3-642-10366-7_1"},{"key":"5115_CR5","doi-asserted-by":"publisher","unstructured":"Jithendra KB, Shahana TK (2018) New results in related key impossible differential cryptanalysis on reduced round AES-192. In: 2018 International Conference On Advances in Communication and Computing Technology, ICACCT 2018, pp 291\u2013295. https:\/\/doi.org\/10.1109\/ICACCT.2018.8529666.","DOI":"10.1109\/ICACCT.2018.8529666"},{"issue":"1","key":"5115_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham E, Shamir A (1991) Differential cryptanalysis of DES-like cryptosystems. J Cryptol 4(1):3\u201372. https:\/\/doi.org\/10.1007\/BF00630563","journal-title":"J Cryptol"},{"key":"5115_CR7","unstructured":"Smart NP, Rijmen V, Warinschi B, Watson G (2021) Algorithms, key sizes and parameters report. Report. ENISA, Nov. 2014. https:\/\/www.enisa.europa.eu\/publications\/algorithms-key-size-and-parameters-report-2014. Accessed 09 Sep 2021"},{"key":"5115_CR8","doi-asserted-by":"publisher","unstructured":"Lee J, Seo Y, Heo J (2018) Analysis of random number generated by quantum noise source and software entropy source. In: Proceedings of the International Conference on Information and Communication Technology Convergence (ICTC). IEEE, Jeju, Korea (South), pp 729\u2013732. https:\/\/doi.org\/10.1109\/ICTC.2018.8539618","DOI":"10.1109\/ICTC.2018.8539618"},{"issue":"1","key":"5115_CR9","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1103\/RevModPhys.89.015004","volume":"89","author":"M Herrero-Collantes","year":"2017","unstructured":"Herrero-Collantes M, Garcia-Escartin JC (2017) Quantum random number generators. Rev Mod Phys 89(1):015004. https:\/\/doi.org\/10.1103\/RevModPhys.89.015004","journal-title":"Rev Mod Phys"},{"issue":"15","key":"5115_CR10","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.114.150501","volume":"114","author":"T Lunghi","year":"2015","unstructured":"Lunghi T et al (2015) Self-testing quantum random number generator. Phys Rev Lett 114(15):150501. https:\/\/doi.org\/10.1103\/PhysRevLett.114.150501","journal-title":"Phys Rev Lett"},{"issue":"5","key":"5115_CR11","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1109\/TCSII.2018.2821904","volume":"65","author":"H Xu","year":"2018","unstructured":"Xu H, Perenzoni D, Tomasi A, Massari N (2018) A 16 \u00d7 16 pixel post-processing free quantum random number generator based on SPADs. IEEE Trans Circuits Syst II Express Briefs 65(5):627\u2013631. https:\/\/doi.org\/10.1109\/TCSII.2018.2821904","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"5115_CR12","doi-asserted-by":"publisher","unstructured":"Pooser RC, Evans PG, Humble TS (2013) Self correcting quantum random number generators using tapered amplifiers. In: Proceedings of the IEEE Photonics Society Summer Topical Meeting Series. IEEE, Waikoloa, HI, USA, pp 147\u2013148. https:\/\/doi.org\/10.1109\/PHOSST.2013.6614471","DOI":"10.1109\/PHOSST.2013.6614471"},{"key":"5115_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/JPHOT.2015.2402127","author":"JM Wang","year":"2015","unstructured":"Wang JM, Xie TY, Zhang HF, Yang DX, Xie C, Wang J (2015) A bias-free quantum random number generation using photon arrival time selectively. IEEE Photonics J. https:\/\/doi.org\/10.1109\/JPHOT.2015.2402127","journal-title":"IEEE Photonics J"},{"issue":"1","key":"5115_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1038\/s41534-019-0208-1","volume":"5","author":"Y-H Li","year":"2019","unstructured":"Li Y-H et al (2019) Quantum random number generation with uncharacterized laser and sunlight. npj Quantum Inf 5(1):97. https:\/\/doi.org\/10.1038\/s41534-019-0208-1","journal-title":"npj Quantum Inf"},{"issue":"2","key":"5115_CR15","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1364\/oe.22.001645","volume":"22","author":"C Abell\u00e1n","year":"2014","unstructured":"Abell\u00e1n C et al (2014) Ultra-fast quantum randomness generation by accelerated phase diffusion in a pulsed laser diode. Opt Express 22(2):1645. https:\/\/doi.org\/10.1364\/oe.22.001645","journal-title":"Opt Express"},{"key":"5115_CR16","unstructured":"ID Quantique (2020). What is the Q in QRNG\u202f? Accessed 07 Jul 2020. https:\/\/www.idquantique.com\/random-number-generation\/overview\/"},{"key":"5115_CR17","doi-asserted-by":"publisher","unstructured":"Shaw G., Sivaram SR, Prabhakar A (2019) Quantum random number generator with one and two entropy sources. In: Proceedings of the National Conference on Communications (NCC). IEEE, Bangalore, India, pp 1\u20134. https:\/\/doi.org\/10.1109\/NCC.2019.8732222","DOI":"10.1109\/NCC.2019.8732222"},{"key":"5115_CR18","doi-asserted-by":"publisher","unstructured":"Mogos G (2016) Quantum random number generator vs. random number generator. In: IEEE International Conference on Communications, pp 423\u2013426. https:\/\/doi.org\/10.1109\/ICComm.2016.7528306.","DOI":"10.1109\/ICComm.2016.7528306"},{"key":"5115_CR19","unstructured":"ID Quantique (2020) Understanding quantum cryptography. ID Quantique SA. https:\/\/www.idquantique.com\/quantum-safe-security\/quantum-key-distribution\/. Accessed 07 Jul 2020"},{"key":"5115_CR20","unstructured":"IDQ (2020) Quantum versus classical random number generators. Switzerland."},{"key":"5115_CR21","unstructured":"ID Quantique (2020) Gaming-and-lotteries. https:\/\/www.idquantique.com\/random-number-generation\/applications\/gaming-and-lotteries\/. Accessed 07 Jul 2020"},{"issue":"2","key":"5115_CR22","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1109\/JSYST.2016.2614953","volume":"12","author":"MM Chatzimichailidou","year":"2018","unstructured":"Chatzimichailidou MM, Dokas IM (2018) RiskSOAP: on the relationship between systems safety and the risk SA provision capability. IEEE Syst J 12(2):1148\u20131157. https:\/\/doi.org\/10.1109\/JSYST.2016.2614953","journal-title":"IEEE Syst J"},{"key":"5115_CR23","doi-asserted-by":"publisher","unstructured":"Socha P, Miskovsky V, Kubatova H, Novotny M (2017) Optimization of Pearson correlation coefficient calculation for DPA and comparison of different approaches. In: International Symposium on Design and Diagnostics of Electronic Circuit and Systems, pp 184\u2013189. https:\/\/doi.org\/10.1109\/DDECS.2017.7934563","DOI":"10.1109\/DDECS.2017.7934563"},{"key":"5115_CR24","unstructured":"T. S. Community. Hamming. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.spatial.distance.hamming.html. Accessed 09 Jul 2020"},{"key":"5115_CR25","volume-title":"Clear-sighted statistics: module 14: one-sample hypothesis tests (slides)","author":"E Volchok","year":"2020","unstructured":"Volchok E (2020) Clear-sighted statistics: module 14: one-sample hypothesis tests (slides). City University of New York (CUNY), New York"},{"key":"5115_CR26","doi-asserted-by":"publisher","unstructured":"Hakim AR, Nusron ZZ (2019) An improved Lblock-s key schedule algorithm. In: International Conference on Information and Communications Technology, pp 232\u2013236. https:\/\/doi.org\/10.1109\/ICOIACT46704.2019.8938569","DOI":"10.1109\/ICOIACT46704.2019.8938569"},{"key":"5115_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2019.102410","author":"SM Kareem","year":"2020","unstructured":"Kareem SM, Rahma AMS (2020) A novel approach for the development of the Twofish algorithm based on multi-level key space. J Inf Secur Appl. https:\/\/doi.org\/10.1016\/j.jisa.2019.102410","journal-title":"J Inf Secur Appl"},{"issue":"3","key":"5115_CR28","first-page":"160","volume":"1","author":"S Sulaiman","year":"2013","unstructured":"Sulaiman S, Muda Z, Juremi J, Mahmod R, Yasin SM (2013) A new shiftcolumn transformation\u202f: an enhancement of Rijndael key scheduling. Int J Cyber-Secur Digit Forensics (IJCSDF) 1(3):160\u2013166","journal-title":"Int J Cyber-Secur Digit Forensics (IJCSDF)"},{"key":"5115_CR29","doi-asserted-by":"publisher","unstructured":"Huang J, Yan H, Lai X (2017) Transposition of AES key schedule. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 10143. LNCS, pp 84\u2013102. https:\/\/doi.org\/10.1007\/978-3-319-54705-3_6","DOI":"10.1007\/978-3-319-54705-3_6"},{"key":"5115_CR30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2909554","author":"R Shahzadi","year":"2019","unstructured":"Shahzadi R, Anwar SM, Qamar F, Ali M, Rodrigues JJPC (2019) Chaos based enhanced RC5 algorithm for security and integrity of clinical images in remote health monitoring. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2019.2909554","journal-title":"IEEE Access"},{"issue":"1","key":"5115_CR31","first-page":"17","volume":"3","author":"S Sahmoud","year":"2013","unstructured":"Sahmoud S, Elmasry W, Shadi A (2013) Enhancement the security of AES against modern attacks by using variable key block cipher. Int Arab J e-Technol 3(1):17\u201326","journal-title":"Int Arab J e-Technol"},{"issue":"10","key":"5115_CR32","first-page":"399","volume":"119","author":"B Maram","year":"2018","unstructured":"Maram B, Gnanasekar JM (2018) A block cipher algorithm to enhance the avalanche effect using dynamic key-dependent S-box and genetic operations. Int J Pure Appl Math 119(10):399\u2013418","journal-title":"Int J Pure Appl Math"},{"key":"5115_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/9802475","volume":"2018","author":"R Saha","year":"2018","unstructured":"Saha R, Geetha G, Kumar G, Kim TH (2018) RK-AES: an improved version of AES using a new key generation process with random keys. Secur Commun Netw 2018:1\u201311. https:\/\/doi.org\/10.1155\/2018\/9802475","journal-title":"Secur Commun Netw"},{"key":"5115_CR34","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.procs.2020.04.113","volume":"171","author":"A Vuppala","year":"2020","unstructured":"Vuppala A, Roshan RS, Nawaz S, Ravindra JVR (2020) An efficient optimization and secured triple data encryption standard using enhanced key scheduling algorithm. Procedia Comput Sci 171:1054\u20131063. https:\/\/doi.org\/10.1016\/j.procs.2020.04.113","journal-title":"Procedia Comput Sci"},{"key":"5115_CR35","doi-asserted-by":"publisher","unstructured":"Leurent G, Pernot C (2021) New representations of the AES key schedule. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 12696. LNCS, pp 54\u201384, 2021. https:\/\/doi.org\/10.1007\/978-3-030-77870-5_3","DOI":"10.1007\/978-3-030-77870-5_3"},{"key":"5115_CR36","doi-asserted-by":"publisher","unstructured":"May L, Henricksen M, Millan W, Carter G, Dawson E (2002) Strengthening the key schedule of the AES. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 2384, pp 226\u2013240.https:\/\/doi.org\/10.1007\/3-540-45450-0_19","DOI":"10.1007\/3-540-45450-0_19"},{"key":"5115_CR37","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3189601","author":"S Afzal","year":"2020","unstructured":"Afzal S, Yousaf M, Afzal H, Alharbe N, Mufti MR (2020) Cryptographic strength evaluation of key schedule algorithms. Secur Commun Netw. https:\/\/doi.org\/10.1155\/2020\/3189601","journal-title":"Secur Commun Netw"},{"key":"5115_CR38","unstructured":"Afzal S, Waqas U, Mir MA, Yousaf M (2015) Statistical analysis of key schedule algorithms of different block ciphers. Science International\u2014Report"},{"key":"5115_CR39","doi-asserted-by":"publisher","unstructured":"Vajapeyam S (2014) Understanding Shannon\u2019s entropy metric for information, pp 1\u20136. https:\/\/doi.org\/10.48550\/arXiv.1405.2061","DOI":"10.48550\/arXiv.1405.2061"},{"key":"5115_CR40","doi-asserted-by":"publisher","unstructured":"G. J. Croll, \u201cBientropy, TriEntropy and primality,\u201d Entropy, vol. 22, no. 3, Mar. 2020, doi: https:\/\/doi.org\/10.3390\/e22030311.","DOI":"10.3390\/e22030311"},{"key":"5115_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The design of Rijndael","author":"J Daemen","year":"2002","unstructured":"Daemen J, Rijmen V (2002) The design of Rijndael. Springer, Berlin"},{"key":"5115_CR42","doi-asserted-by":"publisher","unstructured":"Gullasch D, Bangerter E, Krenn S (2011) Cache games\u2014bringing access-based cache attacks on AES to practice. In: IEEE Symposium on Security and Privacy, pp 490\u2013505. https:\/\/doi.org\/10.1109\/SP.2011.22","DOI":"10.1109\/SP.2011.22"},{"key":"5115_CR43","doi-asserted-by":"publisher","unstructured":"Biryukov A, Canni\u00e8re C (1999) Data encryption standard (DES). In: Encyclopedia of Cryptography and Security. Springer, Boston. https:\/\/doi.org\/10.1007\/0-387-23483-7_94","DOI":"10.1007\/0-387-23483-7_94"},{"key":"5115_CR44","doi-asserted-by":"crossref","unstructured":"Adams C (1997) The CAST-128 encryption algorithm. Accessed 12 Jun 2021. https:\/\/www.rfc-editor.org\/info\/rfc2144","DOI":"10.17487\/rfc2144"},{"key":"5115_CR45","unstructured":"Japan\u2019s First 128-bit Block Cipher \u2018Camellia\u2019 Approved as a New Standard Encryption Algorithm in the Internet. NTT News Release. https:\/\/www.ntt.co.jp\/news\/news05e\/0507\/050720.html. Accessed 17 Jul 2021"},{"key":"5115_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_579","volume-title":"GOST encyclopedia of cryptography and security","author":"C Canni\u00e8re","year":"2011","unstructured":"Canni\u00e8re C (2011) GOST encyclopedia of cryptography and security. Springer, Boston. https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_579"},{"issue":"1","key":"5115_CR47","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2478\/v10127-012-0039-3","volume":"53","author":"NT Courtois","year":"2013","unstructured":"Courtois NT, Gawinecki JA, Song G (2013) Contradiction immunity and guess-then-determine attacks on GOST. Tatra Mt Math Publ 53(1):65\u201379. https:\/\/doi.org\/10.2478\/v10127-012-0039-3","journal-title":"Tatra Mt Math Publ"},{"key":"5115_CR48","unstructured":"\u201cCryptol.\u201d Galois, Inc. https:\/\/cryptol.net\/"},{"key":"5115_CR49","unstructured":"IDQ (2020) quantis-random-number-generator. https:\/\/www.idquantique.com\/random-number-generation\/products\/quantis-random-number-generator. Accessed 07 Jul 2020"},{"key":"5115_CR50","doi-asserted-by":"publisher","unstructured":"Anandakumar NN, Dillibabu S (2012) Correlation power analysis attack of AES on FPGA using customized communication protocol. In: International Conference on Computational Science, Engineering and Information Technology, pp 683\u2013688. https:\/\/doi.org\/10.1145\/2393216.2393330.","DOI":"10.1145\/2393216.2393330"},{"key":"5115_CR51","doi-asserted-by":"publisher","first-page":"18734","DOI":"10.1109\/ACCESS.2019.2896256","volume":"7","author":"Y Niu","year":"2019","unstructured":"Niu Y, Zhang J, Wang A, Chen C (2019) An efficient collision power attack on AES encryption in edge computing. IEEE Access 7:18734\u201318748. https:\/\/doi.org\/10.1109\/ACCESS.2019.2896256","journal-title":"IEEE Access"},{"issue":"2","key":"5115_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3014583","volume":"16","author":"Y Li","year":"2016","unstructured":"Li Y, Chen M, Liu Z, Wang J (2016) Reduction in the number of fault injections for blind fault attack on SPN block ciphers. ACM Trans Embed Comput Syst 16(2):1\u201320. https:\/\/doi.org\/10.1145\/3014583","journal-title":"ACM Trans Embed Comput Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05115-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05115-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05115-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T07:15:50Z","timestamp":1686294950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05115-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":52,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5115"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05115-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"12 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}