Principles and model for improving post-quantum encryption algorithms based on mathematical lattice theory

N.A. Kleimenov, K.Z. Bilyatdinov

Abstract


This paper presents principles that serve as the foundation for a model designed to improve the efficiency of analyzing post-quantum encryption algorithms based on mathematical lattice theory. The model is intended to systematize and enhance the process of improving lattice-based encryption algorithms. Its application addresses the problem of achieving an optimal balance between cryptographic strength and practical efficiency (key sizes, operational speed, memory consumption) when enhancing algorithms based on mathematical lattice theory. The model implements an approach to improving the analysis of post-quantum encryption algorithms, based on the principles of parametric optimization, modularity, and data minimization. The main positive effect is a significant increase in the efficiency of cryptographic algorithm analysis by shifting from descriptive analysis to targeted optimization according to clearly defined criteria (key size, operational speed) while maintaining a guaranteed level of security.


Full Text:

PDF (Russian)

References


Shor P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing. 1997. Vol. 26. No. 5. Pp. 304-328.

Chen L., Jordan S., Liu Y.-K., Moody D., Peralta R., Perlner R., Smith-Tone D. Report on Post-Quantum Cryptography. NIST IR 8105. 2016.

D'Anvers J.P., Karmakar A., Sinha Roy S., Vercauteren F. Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. International Conference on Cryptology in Africa. 2018. Pp 282-305.

Alkim E., Ducas L., Pöppelmann T., Schwabe P. Post-quantum key exchange—A new hope. USENIX Security Symposium. 2016. Vol. 2016. Pp. 3-24.

D'Anvers J.P., Karmakar A., Sinha Roy S., Vercauteren F. Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. International Conference on Cryptology in Africa. 2018. Pp. 3-20.

Bernstein D.J., Lange T. Post-quantum cryptography. Nature. 2017. Vol. 549. No. 7671. Pp. 188-194.

Ducas L., Lepoint T., Lyubashevsky V., Schwabe P., Seiler G., Stehlé D. CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018. Vol. 2018. No. 1. Pp. 2–31.

Lyubashevsky V., Peikert C., Regev O. On Ideal Lattices and Learning with Errors over Rings. Journal of the ACM. 2013. Vol. 60. No. 6. Pp. 2-31.

Güneysu T., Oder T., Pöppelmann T., Schwabe P. Software Speed Records for Lattice-Based Signatures. In: Cryptographic Hardware and Embedded Systems – CHES 2012. Springer. 2012. Pp. 67-82.

Melchor C.A., Aragon N., Bettaieb S., Bidoux L., Blazy O., Deneuville J.-C., Gaborit P., Zémor G. Hamming Quasi-Cyclic (HQC). NIST PQC Round 3 Submission. 2020.

Avanzi R., Bos J., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schanck J.M., Schwabe P., Seiler G., Stehlé D. CRYSTALS-Kyber: Algorithm Specifications and Supporting Documentation. NIST PQC Round 3 Submission. 2020.

Regev O. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Journal of the ACM. 2009. Vol. 56. No. 6. Pp. 2–35.

Lyubashevsky V., Peikert C., Regev O. On Ideal Lattices and Learning with Errors over Rings. Journal of the ACM. 2013. Vol. 60. No. 6. Pp. 2–31.

Hoffstein J., Pipher J., Silverman J.H. NTRU: A Ring-Based Public Key Cryptosystem. In: International Algorithmic Number Theory Symposium (ANTS). Springer. 1998. Pp. 267–288.

National Institute of Standards and Technology (NIST). Post-Quantum Cryptography Standardization. 2022.

David R., Alla H. Petri nets for modeling of dynamic systems: A survey // Automatica. – 1994. – Vol. 30. – No. 2. – P. 175–202


Refbacks

  • There are currently no refbacks.


Abava  Кибербезопасность ИТ конгресс СНЭ

ISSN: 2307-8162