Abstract
Simple side channel attacks on the implementation of elliptic curves scalar point multiplication algorithms are considered. New regular sliding window algorithms for calculating multiple points are proposed. Their optimal parameters are evaluated. The efficiency of the proposed algorithms is investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Hankerson, D., Menezes, A.I., and Vanstone, S., Guide to Elliptic Curve Cryptography, New York: Springer-Verlag, 2004.
Fouque, P.-A., Muller, F., Poupard, G., and Valette, F., Defeating countermeasures based on randomized BSD representations, Crtypographic Hardware and Embedded Systems – CHES 2004, Joye, M. and Quisquater, J.J., Eds., Lecture Notes in Computer Science, vol. 3156, Berlin: Springer, 2004, pp. 312–327. https://doi.org/10.1007/978-3-540-28632-5_23
Möller, B., Securing elliptic curve point multiplication against side-channel attacks, Information Security. ISC 2001, Davida, G.I. and Frankel, Y., Eds., Lecture Notes in Computer Science, vol. 2200, Berlin: Springer, 2001, pp. 324–334. https://doi.org/10.1007/3-540-45439-X_22
Möller, B., Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks, Information Security. ISC 2002, Chan, A.H. and Gligor, V., Eds., Lecture Notes in Computer Science, vol. 2433, Berlin: Springer, 2002, pp. 402–441. https://doi.org/10.1007/3-540-45811-5_31
Shenets, N.N., Bystrye vychislitel’nye algoritmy v kriptografii. Uchebnoe posobie (Fast Computing Algorithms in Cryptography: Handbook), St. Petersburg: Izd. Politekhn. Univ., 2017. https://doi.org/10.18720/SPBPU/2/i17-396
Okeya, K. and Takagi, T., The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks, Topics in Cryptology – CT-RSA 2003, Joye, M., Ed., Lecture Notes in Computer Science, vol. 2612, Berlin: Springer, 2003, pp. 328–343. https://doi.org/10.1007/3-540-36563-X_23
Okeya, K. and Takagi, T., A more flexible countermeasure against side channel attacks using window method, Cryptographic Hardware and Embedded Systems – CHES 2003, Walter, C.D., Koç, Ç.K., and Paar, C., Eds., Lecture Notes in Computer Science, vol. 2779, Berlin: Springer, 2003, pp. 397–410. https://doi.org/10.1007/978-3-540-45238-6_31
Montgomery, P., Speeding the pollard and elliptic curve methods of factorization, Math. Comp., 1987, vol. 48, pp. 243–264. https://doi.org/10.1090/S0025-5718-1987-0866113-7
Hamburg, M., Faster Montgomery and double-add ladders for short weierstrass curves IACR Trans. Cryptographic Hardware Embedded Syst., 2020, vol. 4, pp. 189–208.https://doi.org/10.13154/tches.v2020.i4.189-208
Joye, M., Highly regular right-to-left algorithms for scalar multiplication, Cryptographic Hardware and Embedded Systems - CHES 2007, Paillier, P. and Verbauwhede, I., Eds., Lecture Notes in Computer Science, vol. 4727, Berlin: Springer, 2007, pp. 135–147. https://doi.org/10.1007/978-3-540-74735-2_10
Lim, C.H. and Lee, P.J., More flexible exponentiation with precomputation, Advances in Cryptology – CRYPTO ’94, Desmedt, Y.G., Ed., Lecture Notes in Computer Science, vol. 839, Berlin: Springer, 1994, pp. 95–107. https://doi.org/10.1007/3-540-48658-5_11
Koç, C.K., Analysis of sliding window techniques for exponentiation, Comput. Math. Appl., 1995, vol. 30, no. 10, pp. 17–24. https://doi.org/10.1016/0898-1221(95)00153-P
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by E. Oborin
About this article
Cite this article
Shenets, N.N., Petushkov, A.S. New Regular Sliding Window Algorithms for Elliptic Curve Scalar Point Multiplication. Aut. Control Comp. Sci. 55, 1029–1038 (2021). https://doi.org/10.3103/S0146411621080289
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411621080289