IMPLEMENTATION-ORIENTED ANALYSIS OF A HYBRID POST-QUANTUM CRYPTOGRAPHIC FRAMEWORK FOR SECURE DATA TRANSMISSION

Turdiyev T. T.


Annotatsiya

This article investigates the practical implementation of secure data transmission systems based on post-quantum cryptographic algorithms. The development of quantum computing technologies creates serious security challenges for traditional public-key cryptographic algorithms such as RSA and ECC. Therefore, the design and adaptation of cryptographic mechanisms resistant to quantum attacks have become important research tasks. The article analyzes a hybrid post-quantum cryptographic model consisting of NTRUEncrypt, SPHINCS+, and BIKE from an implementation-oriented perspective. The study evaluates security level, processing speed, key size, computational complexity, and applicability in real network environments. The results show that the hybrid approach is a promising solution for secure data transmission, but its deployment in practical systems requires further optimization.


Adabiyotlar

  1. S. R. Gulomov, T. R. Khudayberganov, M. X. Ravshanova, T. T. Turdiev, and S. S. Atabayev, “Exploring Post-Quantum Cryptographic Algorithms for Secure Data Transmission,” 2024 IEEE 3rd International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE), pp. 1480–1483, 2024, doi: 10.1109/PIERE62470.2024.10805050.
  2. P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM Journal on Computing, 1997.
  3. D. J. Bernstein, J. Buchmann, and E. Dahmen, Post-Quantum Cryptography. Berlin, Germany: Springer, 2009.
  4. L. Chen et al., “Report on Post-Quantum Cryptography,” National Institute of Standards and Technology, 2016.
  5. N. J. Alagic et al., “NIST PQC Standardization Process,” National Institute of Standards and Technology, 2020.
  6. L. K. Grover, “A Fast Quantum Mechanical Algorithm for Database Search,” Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996.
  7. M. Ajtai, “Generating Hard Instances of Lattice Problems,” Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.
  8. C. Peikert, “A Decade of Lattice Cryptography,” Foundations and Trends in Theoretical Computer Science, 2016.
  9. J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A Ring-Based Public Key Cryptosystem,” Algorithmic Number Theory, Cambridge University Press, 2010.
  10. [10] R. C. Merkle, “A Digital Signature Based on a Conventional Encryption Function,” Advances in Cryptology — CRYPTO ’87, Springer, 1988.
  11. D. J. Bernstein et al., “SPHINCS+: A Compact Hash-Based Signature Scheme,” ACM SIGSAC Conference on Computer and Communications Security, 2015.
  12. R. J. McEliece, “A Public-Key Cryptosystem Based on Algebraic Coding Theory,” Deep Space Network Progress Report, 1978.
  13. R. Misoczki et al., “The BIKE Post-Quantum Cryptosystem,” IEEE Transactions on Information Theory, 2021.
  14. J. Ding and A. Petzoldt, “Multivariate Public Key Cryptosystems,” Journal of Mathematical Cryptology, 2017.
  15. L. Chen et al., “On the Security of Post-Quantum Cryptographic Systems,” Journal of Cryptographic Engineering, 2018.