|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ЦЭМИ РАН |
||
Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methodsстатья Исследовательская статья
Статья опубликована в высокорейтинговом журнале
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 12 декабря 2018 г.
- Автор: Хлебородов Д.С.
- Журнал: Advances in Computational Mathematics
- Год издания: 2017
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 1
- Последняя страница: 19
- DOI: 10.1007/s10444-017-9581-5
- Аннотация: This article presents two methods for developing algorithms of computing scalar multiplication in groups of points on an elliptic curve over finite fields. Two new effective algorithms have been presented: one of them is based on a binary Non-Adjacent Form of scalar representation and another one on a binary of scalar representation method. All algorithms were developed based on simple and composite operations with point and also based on affine and Jacobi coordinates systems taking into account the latest achievements in computing cost reduction. Theorems concerning their computational complexity are formulated and proved for these new algorithms. In the end of this article comparative analysis of both new algorithms among themselves and previously known algorithms are represented.
- Добавил в систему: Хлебородов Денис Сергеевич