Skip to main content
SpringerLink
Log in

CryptoQNRG: a new framework for evaluation of cryptographic strength in quantum and pseudorandom number generation for key-scheduling algorithms

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In a cryptosystem, a cipher's security is directly dependent on a key-schedule or key-scheduling algorithm (KSA) or that is used for both encryption and decryption. The random-number-based KSA adds another layer of security and prevents hackers from performing cryptanalysis. Several previous studies have investigated the strength of a cipher's encryption process. The strength evaluation of the key-scheduling process has received less attention that can lead to weaknesses in the overall encryption process. This paper proposes a new framework consisting of cryptographic strength evaluation criteria for random number generators (RNG)-based KSAs. Our framework (CryptoQNRG) evaluates different key-schedules based on pseudorandom and quantum random number generators with a set of tests. There are test suites that compare the strength of KSAs for different block ciphers. To the best of our knowledge this is the first time that a framework is built to compare the strength of KSAs incorporating RNGs and various block ciphers. CryptoQNRG comprises of four tests: Frequency, Bit_Correlation, Bit_Interfold, and Bit_Entropy. The tests are used to explore cryptographic properties such as unpredictability, balance of bits, correlation, confusion, and diffusion in the subkeys generated by the RNG-based KSA. We have evaluated the most common KSAs with different block ciphers and a significant outcome of the proposed framework is the distinction between strong and weak RNG-based KSAs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

The data used to support the findings of this study are included in this article.

References

  1. Stallings W (2005) Cryptography and network security: principles and practices. Pearson, New York

    Google Scholar 

  2. 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–505. https://doi.org/10.1109/RTEICT.2017.8256647

  3. Shi FL, Bin H (2010) Propagation properties of symmetric Boolean functions. In: International Conference on Intelligent Computation Technology and Automation, pp 947–950. https://doi.org/10.1109/ICICTA.2010.614

  4. Biryukov A, Khovratovich D (2009) Related-key cryptanalysis of the full AES-192 and AES-256. In: Advances in Cryptology—ASIACRYPT Lecture Notes in Computer Science. Springer, Berlin, pp 1–18

  5. 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–295. https://doi.org/10.1109/ICACCT.2018.8529666.

  6. Biham E, Shamir A (1991) Differential cryptanalysis of DES-like cryptosystems. J Cryptol 4(1):3–72. https://doi.org/10.1007/BF00630563

    Article  MathSciNet  MATH  Google Scholar 

  7. 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

  8. 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–732. https://doi.org/10.1109/ICTC.2018.8539618

  9. 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

    Article  MathSciNet  Google Scholar 

  10. 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

    Article  Google Scholar 

  11. Xu H, Perenzoni D, Tomasi A, Massari N (2018) A 16 × 16 pixel post-processing free quantum random number generator based on SPADs. IEEE Trans Circuits Syst II Express Briefs 65(5):627–631. https://doi.org/10.1109/TCSII.2018.2821904

    Article  Google Scholar 

  12. 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–148. https://doi.org/10.1109/PHOSST.2013.6614471

  13. 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

    Article  Google Scholar 

  14. 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

    Article  Google Scholar 

  15. Abellán 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

    Article  Google Scholar 

  16. ID Quantique (2020). What is the Q in QRNG ? Accessed 07 Jul 2020. https://www.idquantique.com/random-number-generation/overview/

  17. 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–4. https://doi.org/10.1109/NCC.2019.8732222

  18. Mogos G (2016) Quantum random number generator vs. random number generator. In: IEEE International Conference on Communications, pp 423–426. https://doi.org/10.1109/ICComm.2016.7528306.

  19. ID Quantique (2020) Understanding quantum cryptography. ID Quantique SA. https://www.idquantique.com/quantum-safe-security/quantum-key-distribution/. Accessed 07 Jul 2020

  20. IDQ (2020) Quantum versus classical random number generators. Switzerland.

  21. ID Quantique (2020) Gaming-and-lotteries. https://www.idquantique.com/random-number-generation/applications/gaming-and-lotteries/. Accessed 07 Jul 2020

  22. Chatzimichailidou MM, Dokas IM (2018) RiskSOAP: on the relationship between systems safety and the risk SA provision capability. IEEE Syst J 12(2):1148–1157. https://doi.org/10.1109/JSYST.2016.2614953

    Article  Google Scholar 

  23. 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–189. https://doi.org/10.1109/DDECS.2017.7934563

  24. T. S. Community. Hamming. https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.distance.hamming.html. Accessed 09 Jul 2020

  25. Volchok E (2020) Clear-sighted statistics: module 14: one-sample hypothesis tests (slides). City University of New York (CUNY), New York

    Google Scholar 

  26. Hakim AR, Nusron ZZ (2019) An improved Lblock-s key schedule algorithm. In: International Conference on Information and Communications Technology, pp 232–236. https://doi.org/10.1109/ICOIACT46704.2019.8938569

  27. 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

    Article  Google Scholar 

  28. Sulaiman S, Muda Z, Juremi J, Mahmod R, Yasin SM (2013) A new shiftcolumn transformation : an enhancement of Rijndael key scheduling. Int J Cyber-Secur Digit Forensics (IJCSDF) 1(3):160–166

    Google Scholar 

  29. 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–102. https://doi.org/10.1007/978-3-319-54705-3_6

  30. 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

    Article  Google Scholar 

  31. 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–26

    Google Scholar 

  32. 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–418

    Google Scholar 

  33. 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–11. https://doi.org/10.1155/2018/9802475

    Article  Google Scholar 

  34. 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–1063. https://doi.org/10.1016/j.procs.2020.04.113

    Article  Google Scholar 

  35. 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–84, 2021. https://doi.org/10.1007/978-3-030-77870-5_3

  36. 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–240.https://doi.org/10.1007/3-540-45450-0_19

  37. 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

    Article  Google Scholar 

  38. Afzal S, Waqas U, Mir MA, Yousaf M (2015) Statistical analysis of key schedule algorithms of different block ciphers. Science International—Report

  39. Vajapeyam S (2014) Understanding Shannon’s entropy metric for information, pp 1–6. https://doi.org/10.48550/arXiv.1405.2061

  40. G. J. Croll, “Bientropy, TriEntropy and primality,” Entropy, vol. 22, no. 3, Mar. 2020, doi: https://doi.org/10.3390/e22030311.

  41. Daemen J, Rijmen V (2002) The design of Rijndael. Springer, Berlin

    Book  MATH  Google Scholar 

  42. Gullasch D, Bangerter E, Krenn S (2011) Cache games—bringing access-based cache attacks on AES to practice. In: IEEE Symposium on Security and Privacy, pp 490–505. https://doi.org/10.1109/SP.2011.22

  43. Biryukov A, Cannière C (1999) Data encryption standard (DES). In: Encyclopedia of Cryptography and Security. Springer, Boston. https://doi.org/10.1007/0-387-23483-7_94

  44. Adams C (1997) The CAST-128 encryption algorithm. Accessed 12 Jun 2021. https://www.rfc-editor.org/info/rfc2144

  45. Japan’s First 128-bit Block Cipher ‘Camellia’ 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

  46. Cannière C (2011) GOST encyclopedia of cryptography and security. Springer, Boston. https://doi.org/10.1007/978-1-4419-5906-5_579

    Book  Google Scholar 

  47. Courtois NT, Gawinecki JA, Song G (2013) Contradiction immunity and guess-then-determine attacks on GOST. Tatra Mt Math Publ 53(1):65–79. https://doi.org/10.2478/v10127-012-0039-3

    Article  MathSciNet  MATH  Google Scholar 

  48. “Cryptol.” Galois, Inc. https://cryptol.net/

  49. IDQ (2020) quantis-random-number-generator. https://www.idquantique.com/random-number-generation/products/quantis-random-number-generator. Accessed 07 Jul 2020

  50. 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–688. https://doi.org/10.1145/2393216.2393330.

  51. Niu Y, Zhang J, Wang A, Chen C (2019) An efficient collision power attack on AES encryption in edge computing. IEEE Access 7:18734–18748. https://doi.org/10.1109/ACCESS.2019.2896256

    Article  Google Scholar 

  52. 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–20. https://doi.org/10.1145/3014583

    Article  Google Scholar 

Download references

Funding

This research work received funding by University of Hertfordshire, UK.

Author information

Authors and Affiliations

  1. Department of Computer Science, School of Physics, Engineering and Computer Science, University of Hertfordshire, Hatfield, UK

    A. Saini, A. Tsokanos & R. Kirner

Authors
  1. A. Saini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Tsokanos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Kirner
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

AS and AT devised the idea presented here. AS developed the theory, performed the computations, and prepared figures. RK and AS verified the analytical methods. All authors reviewed the manuscript.

Corresponding author

Correspondence to A. Saini.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saini, A., Tsokanos, A. & Kirner, R. CryptoQNRG: a new framework for evaluation of cryptographic strength in quantum and pseudorandom number generation for key-scheduling algorithms. J Supercomput 79, 12219–12237 (2023). https://doi.org/10.1007/s11227-023-05115-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05115-4

Keywords

Search

Navigation