A Research of Methods of Elliptic Curve Point Multiplication Effectiveness

Student: Larionova Iuliia

Faculty: HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE)

Educational Programme: Cyber Security (Specialist)

Final Grade: 9

Year of Graduation: 2020

Elliptic curve point multiplication is one of the fundamental problems in public-key cryptography, including Russian cryptographic algorithms. The execution time of this operation significantly affects the speed of cryptographic algorithms, especially when increasing the lengths of their parameters. This work describes a research of the time effectiveness to take a point multiplication using various methods on 256, 512-bit elliptic curves with parameters recommended by GOST R 34.10-2012, and 640-bit elliptic curves in C using the mechanisms of the libakrypt library .

Full text (added January 14, 2020)

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses