An Intrusion Resistant SCADA Framework Based on Quantum and Post-Quantum Scheme
Source abstract
Abstract
The rapid emergence of quantum computing threatens current Supervisory Control and Data Acquisition (SCADA) security standards, mainly, American Gas Association (AGA)-12. Therefore, researchers are developing various security schemes based on either quantum or post-quantum algorithms. However, the efficiency of quantum algorithms impacts the security of the post-quantum digital signature scheme. We propose an intrusion resistant algorithm exploiting and applying quantum principles in the post-quantum signature algorithm. We use the Bennett 1992 (B92) protocol, a quantum key distribution scheme, to obtain the cipher, and the practical Stateless Hash-based Signatures (SPHINCS)-256 protocol to obtain a post-quantum signature. However, instead of Chacha-12, a well-known cryptographically secure pseudo-random number generator, we apply a quantum random number generator to obtain a truly random Hash to Obtain Random Subset (HORS) signature with Tree (HORST) secret key used in SPHINCS-256. We have implemented the design in Python with the Quantum Information Toolkit. We have validated the proposed algorithm using the Probabilistic Model Checking for Performance and Reliability Analysis (PRISM) and Scyther tools. Moreover, the National Institute of Standards and Technology (NIST) statistical tests show that the proposed algorithm key pairs have randomness of 98% and RSA and ECDSA are below 96%.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Faculty of Computer Science, Dalhousie University, Halifax, NS B3H 4R2, Canada
Research and Development, Cistel Technology, Ottawa, ON K2E 7V7, Canada
Research and Development, Technologie Sanstream, Gatineau, QC J8Y 2V5, Canada
Funding
Natural Sciences and Engineering Research Council of Canada
References (61)
Show source-provided references
1. A survey of security in SCADA networks: Current issues and future challenges10.1109/ACCESS.2019.2926441 ↗
2. Kang, D.J., Lee, J.J., Kim, S.J., and Park, J.H. (2009, January 26–29). Analysis on cyber threats to SCADA systems. Proceedings of the 2009 Transmission & Distribution Conference & Exposition: Asia and Pacific, Seoul, Korea.10.1109/TD-ASIA.2009.5357008 ↗
3. Shor’s quantum factoring algorithm10.1090/psapm/058/1922897 ↗
4. Grover, L.K. (1996, January 22–24). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, New York, NY, USA.10.1145/237814.237866 ↗
5. Yanofsky, N.S., and Mannucci, M.A. (2008). Quantum Computing for Computer Scientists, Cambridge University Press.10.1017/CBO9780511813887 ↗
6. Kaye, P., Laflamme, R., and Mosca, M. (2007). An Introduction to Quantum Computing, Oxford University Press.10.1093/oso/9780198570004.001.0001 ↗
7. Gidney, C., and Ekerå, M. (2019). How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits. arXiv.
8. Wilcox, Z. (2020, August 29). Lessons From The History Of Attacks On Secure Hash Functions. Available online: https://electriccoin.co/blog/lessons-from-the-history-of-attacks-on-secure-hash-functions/.
9. Zhang, X., Dong, Z.Y., Wang, Z., Xiao, C., and Luo, F. (2015, January 8–12). Quantum Cryptography Based Cyber-Physical Security Technology for Smart Grids. Proceedings of the 10th International Conference on Advances in Power System Control, Operation & Management (APSCOM 2015), Hong Kong, China.
10. Padamvathi, V., Vardhan, B.V., and Krishna, A. (2016, January 27–28). Quantum cryptography and quantum key distribution protocols: A survey. Proceedings of the 2016 IEEE 6th International Conference on Advanced Computing (IACC), Bhimavaram, India.10.1109/IACC.2016.109 ↗
11. Nurhadi, A.I., and Syambas, N.R. (2018, January 12–13). Quantum key distribution (QKD) protocols: A survey. Proceedings of the 2018 4th International Conference on Wireless and Telematics (ICWT), Bali, Indonesia.10.1109/ICWT.2018.8527822 ↗
12. Chen, L., Chen, L., Jordan, S., Liu, Y.K., Moody, D., Peralta, R., Perlner, R., and Smith-Tone, D. (2016). Report on Post-Quantum Cryptography, US Department of Commerce, National Institute of Standards and Technology.10.6028/NIST.IR.8105 ↗
13. Bernstein, D.J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., and Wilcox-O’Hearn, Z. (2015, January 26–30). SPHINCS: Practical stateless hash-based signatures. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.10.1007/978-3-662-46800-5_15 ↗
14. Attacks on Cryptographic Hash Functions and Advances
15. ChaCha, a variant of Salsa20
16. Goll, M., and Gueron, S. (2014, January 7–9). Vectorization on ChaCha stream cipher. Proceedings of the 2014 11th International Conference on Information Technology: New Generations, Las Vegas, NV, USA.10.1109/ITNG.2014.33 ↗
17. Differential Cryptanalysis of Salsa and ChaCha-An Evaluation with a Hybrid Model
18. Chailloux, A., Naya-Plasencia, M., and Schrottenloher, A. (2017). An efficient quantum collision search algorithm and implications on symmetric cryptography. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Springer.10.1007/978-3-319-70697-9_8 ↗
19. (2020, August 30). Quantis QRNG ChipSystem-on-Chip for Automotive, Computing, Critical Infrastructure, IoT, Mobile & sEcurity Applications. Available online: https://www.idquantique.com/random-number-generation/products/quantis-qrng-chip/.
20. Chip-based quantum key distribution10.1038/ncomms13984 ↗
21. Parvez, B., Ali, J., Ahmed, U., and Farhan, M. (2015, January 11–13). Framework for implementation of AGA 12 for secured SCADA operation in Oil and Gas Industry. Proceedings of the 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, India.
22. Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., and Schanck, J. (2016). Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. Proceedings of the International Conference on Selected Areas in Cryptography, Springer.10.1007/978-3-319-69453-5_18 ↗
23. Mavroeidis, V., Vishi, K., Zych, M.D., and Jøsang, A. (2018). The impact of quantum computing on present cryptography. arXiv.10.14569/IJACSA.2018.090354 ↗
24. Routray, S.K., Jha, M.K., Sharma, L., Nyamangoudar, R., Javali, A., and Sarkar, S. (2017). Quantum cryptography for iot: Aperspective. Proceedings of the 2017 International Conference on IoT and Application (ICIOT), IEEE.10.1109/ICIOTA.2017.8073638 ↗
25. A single quantum cannot be cloned10.1038/299802a0 ↗
26. Quantum cryptography over 23 km in installed under-lake telecom fibre10.1209/epl/i1996-00343-4 ↗
27. Bennett, C.H., and Brassard, G. (1984, January 9–12). Quantum cryptography: Public key distribution and coin tossing. Proceedings of the International Conference on Computers, Systems and Signal Processing, Bangalore, India.
28. Bennett, C.H. (1992). Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett., 68.10.1103/PhysRevLett.68.3121 ↗
29. Practical challenges in quantum key distribution10.1038/npjqi.2016.25 ↗
30. Quantum cryptanalysis of hash and claw-free functions10.1145/261342.261346 ↗
31. Becker, G. (2008). Merkle Signature Schemes, Merkle Trees and Their Cryptanalysis, Ruhr-University Bochum.
32. Reyzin, L., and Reyzin, N. (2002). Better than BiBa: Short one-time signatures with fast signing and verifying. Proceedings of the Australasian Conference on Information Security and Privacy, Springer.10.1007/3-540-45450-0_11 ↗
33. Aumasson, J.P., and Endignoux, G. (2018). Improving stateless hash-based signatures. Cryptographers’ Track at the RSA Conference, Springer.10.1007/978-3-319-76953-0_12 ↗
34. Nuhamara, B.R.H., and Syambas, N.R. (2018). An Evaluation of Quantum Key Distribution in QuVis Simulation Software. Proceedings of the 2018 4th International Conference on Wireless and Telematics (ICWT), IEEE.10.1109/ICWT.2018.8527790 ↗
35. Ruj, S., and Roy, B. (2008). Key predistribution schemes using codes in wireless sensor networks. Proceedings of the International Conference on Information Security and Cryptology, Springer.10.1109/CSE.2009.35 ↗
36. Choudhari, S.P., and Chakole, M.B. (2017). Reed solomon code for WiMAX network. Proceedings of the 2017 International Conference on Communication and Signal Processing (ICCSP), IEEE.10.1109/ICCSP.2017.8286801 ↗
37. Riley, M., and Richardson, I. (2020, August 30). An Introduction to Reed-Solomon Codes: Principles, Architecture and Implementation. Available online: https://www.cs.cmu.edu/~guyb/realworld/reedsolomon/reed$_$solomon$_$codes.html.
38. Upadhyay, Darshana and Sampalli, Srinivas (2020). SCADA (Supervisory Control and Data Acquisition) systems: Vulnerability assessment and security recommendations. Comput. Secur., 89.10.1016/j.cose.2019.101666 ↗
39. Stouffer, Keith and Falco, Joseph and Kent, Karen (2020, August 30). Guide to Supervisory Control and Data Acquisition (SCADA) and Industrial Control Systems Security, Available online: https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-82r2.pdf.
40. (2020, August 30). Scalable Quantum Cryptography Network For Protected Automation Communication. Energy.gov.2017. US Department, Available online: https://www.energy.gov/sites/prod/files/2017/05/f34/Qubitekk$_$QKD$_$FactSheet.pdf.2017.
41. Bailey, David and Wright, Edwin (2003). Practical SCADA for Industry, Elsevier.
42. Clarifying the subset-resilience problem
43. Bernstein, D.J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., and Schwabe, P. (2019, January 11–15). The SPHINCS+ signature framework. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.
44. Herrero-Collantes, M., and Garcia-Escartin, J.C. (2017). Quantum random number generators. Rev. Mod. Phys., 89.10.1103/RevModPhys.89.015004 ↗
45. Quantum random number generators and their applications in cryptography10.1117/12.919920 ↗
46. ID Quantique (2020, August 30). Quantum Versus Classical Random Number Generator. Available online: https://marketing.idquantique.com/acton/attachment/11868/f-64900ef6-6e7e-4b4c-a9f9-c912a2cfde59/1/-/-/-/-/Classical$%$20RNG$%$20Vs$%$20QRNG$_$White$%$20Paper.pdf.
47. Kwiatkowska, M., Norman, G., and Parker, D. (2002). PRISM: Probabilistic symbolic model checker. Proceedings of the International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Springer.10.1007/3-540-46029-2_13 ↗
48. Cremers, C. (2014). Scyther User Manual, Department of Computer Science, University of Oxford.
49. Papanikolaou, N.K. (2004). Techniques for Design and Validation of Quantum Protocols. [Ph.D Thesis, Department of Computer Science, University of Warwick].
50. Kuppam, S. (2018). Modelling and Analysis of Quantum Key Distribution Protocols, BB84 and B92, in Communicating Quantum Processes (CQP) language and Analysing in PRISM. arXiv.10.5220/0006834500750082 ↗
51. Kuppam, A. (2016). Modelling BB84, B92 in CQP and Analysing in PRISM. arXiv.
52. Chatterjee, R., Joarder, K., Chatterjee, S., Sanders, B.C., and Sinha, U. (2019). qkdSim: An experimenter’s simulation toolkit for QKD with imperfections, and its performance analysis with a demonstration of the B92 protocol using heralded photon. arXiv.10.1103/PhysRevApplied.14.024036 ↗
53. Bergholm, V., Biamonte, J.D., and Whitfield, J.D. (2020, August 30). Quantum Information Toolkit. Available online: http://qit.sourceforge.net.
54. Crépeau, C. (1997). Efficient cryptographic protocols based on noisy channels. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Springer.10.1007/3-540-69053-0_21 ↗
55. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., and Barker, E. (2001). A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, Booz-Allen and Hamilton inc Mclean va. Technical Report.10.6028/NIST.SP.800-22 ↗
56. Statistical Analysis of Reduced Round Compression Functions of SHA-3 Second Round Candidates
57. Datcu, O., Macovei, C., and Hobincu, R. (2020). Chaos Based Cryptographic Pseudo-Random Number Generator Template with Dynamic State Change. Appl. Sci., 10.10.3390/app10020451 ↗
58. (2020, August 30). RSA Cryptography Algorithm. Available online: http://algohub.me/algo/rsa-cryptography-algorithm.html.
59. (2020, August 30). How Fast Does a Pseudorandom Number Generator Have to be in Order to be Competitive?. Available online: https://crypto.stackexchange.com/questions/62736/how-fast-does-a-pseudorandom-number-generator-have-to-be-in-order-to-be-competit.
60. Sequency-ordered complex Hadamard transform: Properties, computational complexity and applications10.1109/TSP.2008.923195 ↗
61. Philip, M.A. (2017). A survey on lightweight ciphers for IoT devices. Proceedings of the 2017 International Conference on Technological Advancements in Power and Energy (TAP Energy), IEEE.10.1109/TAPENERGY.2017.8397271 ↗