Analysis of ways to increase stability of cryptographic algorithms on algebraic lattices against time attacks
DOI:
https://doi.org/10.30837/rt.2021.4.207.05Keywords:
algebraic lattices, discrete normal distribution, SAGA tests, time attacksAbstract
The aim of this work is to study the algorithms, the stability of which is based on the search for a short lattice vector, as well as to obtain time-resistant parameters of these algorithms. Existing methods for generating keys and choosing parameters for cryptographic transformations on algebraic lattices resistant to time attacks are considered. It is shown that the uniform distribution of coefficients for generating the NTRU algorithm keys has certain shortages, namely, a limited number of parameters suitable for use in cryptographical transformations. This is due to the vulnerability of this algorithm to time attacks. The possibility of using a discrete normal (Gaussian) distribution to form a key pair, which will prevent the sensitivity of the algorithm to time attacks, is considered. This method of generation requires checking the obtained sample for compliance with the properties of the normal distribution. The usage of SAGA tests has been proposed. They make it possible to check the Gaussian samples obtained using the discrete normal distribution. The verification result shows whether or not the sample has properties that are inherent in the normal distribution. The application of the SAGA statistical tests to the NTRU cryptographic transformation polynomials allowed us to conclude that the discrete Gaussian sample makes it possible to generate time-resistant parameters using the norm or the length of the short basis (vector) of the lattice as the mean-square deviation.
References
Hoffstein J., Lieman D., Pipjer J., Silverman J. NTRU: A public key cryptosystem // Conference International Algorithmic Number Theory Symposium Springer, Berlin, Heidelberg Pages 267-288 Publication date 1998/6/21.
Alagic G., Alperin-Sheriff J., Apon D., Cooper D., Dang Q., Miller C., Moody D., Peralta R., Perlner R., Robinson A., Smith-Tone D. and Y.-K. Liu. Status Report on the First Round of the NIST Post-Quantum Cryptography Standardization Process. National Institute of Standards and Technology, Interagency/Internal Report 8240, 2019.
IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices’, Institute of Electrical and Electronics Engineers, IEEE Standard 1363.1-2008, 2009.
Kocher P. C. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems // Advances in Cryptology – CRYPTO’96, in Lecture Notes in Computer Science, vol. 1109, Springer, Berlin, Heidelberg, 1996. P. 104–113.
Isochronous Gaussian Sampling: From Inception to Implementation. With James Howe and Thomas Prest and Thomas Ricosset. In the proceedings of PQ-Crypto 2020.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
