Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12258/18046
Title: Comparative analysis of the scalar point multiplication algorithms in the NIST FIPS 186 elliptic curve cryptography
Authors: Babenko, M. G.
Бабенко, М. Г.
Redvanov, A. S.
Редванов, А. С.
Keywords: Public key cryptography;Security of data;Control systems;Geometry
Issue Date: 2021
Publisher: CEUR-WS
Citation: Babenko M. G., Tchernykh A., Redvanov A. S., Djurabaev A. Comparative analysis of the scalar point multiplication algorithms in the NIST FIPS 186 elliptic curve cryptography // CEUR Workshop Proceedings. - 2021. - Том 2913. - Стр. 21 - 31
Series/Report no.: CEUR Workshop Proceedings
Abstract: In today's world, the problem of information security is becoming critical. One of the most common cryptographic approaches is the elliptic curve cryptosystem. However, in elliptic curve arithmetic, the scalar point multiplication is the most expensive compared to the others. In this paper, we analyze the efficiency of the scalar multiplication on elliptic curves comparing Affine, Projective, Jacobian, Jacobi-Chudnovsky, and Modified Jacobian representations of an elliptic curve. For each coordinate system, we compare Fast exponentiation, Nonadjacent form (NAF), and Window methods. We show that the Window method is the best providing lower execution time on considered coordinate systems
URI: http://hdl.handle.net/20.500.12258/18046
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 1816 .pdf
  Restricted Access
458.04 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.