A complex of methods for the improvement of post-quantum encryption algorithms based on the mathematical lattice theory

N.A. Kleymenov, K.Z. Biliatdinov

Abstract


Methodological solutions for improving lattice-based post-quantum encryption algorithms are presented. A set of interconnected optimization techniques is proposed, aimed at enhancing the performance and cryptographic strength of cryptographic primitives. The complex of techniques formalizes the process of improving the algebraic structure underlying modern standards such as CRYSTALS-Kyber. The framework comprises three targeted methodologies: modification of the algebraic ideal to accelerate computations, management of matrix dimensions to enhance security, and introduction of nonlinear distortions to counter specialized attacks. Each methodology includes a formalized sequence of actions, a system of verifiable performance indicators, and clear criteria for evaluating optimization results.


Full Text:

PDF (Russian)

References


Ducas L. et al. "CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme".

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

Avanzi R., Bos J., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., et al. CRYSTALS-Kyber: Algorithm Specifications and Supporting Documentation. NIST PQC Round 3 Submission. 2020. 45 p.

Bai S., Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schwabe P., et al. CRYSTALS-Dilithium: Algorithm Specifications and Supporting Documentation. NIST PQC Round 3 Submission. 2021. 63 p.

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.

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

Langlois A., Stehlé D. Worst-case to average-case reductions for module lattices. Designs, Codes and Cryptography. 2015. Vol. 75. No. 3. Pp. 565-599.

Zhang J., Zhang Z., Ding J., Snook M., Dagdelen Ö. Authenticated Key Exchange from Ideal Lattices. In: Advances in Cryptology – EUROCRYPT 2015. Springer, 2015. Pp. 719-751.

López-Alt A., Tromer E., Vaikuntanathan V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the 44th annual ACM symposium on Theory of computing. 2012. Pp. 1219-1234.

Stehlé D., Steinfeld R. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In: Advances in Cryptology – EUROCRYPT 2011. Springer, 2011. Pp. 27-47.

Pollard J.M. The fast Fourier transforms in a finite field. Mathematics of Computation, 1971, 25(114): 365-374.

Boneh D., Gentry C., Gorbunov S., Halevi S., Nikolaenko V., Segev G., et al. Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits. In: Advances in Cryptology – EUROCRYPT 2014. Springer, 2014. Pp. 533-556.


Refbacks

  • There are currently no refbacks.


Abava  Кибербезопасность Monetec 2026 СНЭ

ISSN: 2307-8162