|
ИСТИНА |
Войти в систему Регистрация |
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
Comparative Analysis of Calculations in Cryptographic Protocols Using a Combination of Different Bases of Finite Fieldsстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 23 ноября 2017 г.
- Авторы: Гашков С.Б., Фролов А.Б.
- Сборник: Advances in Intelligent Systems and Computing
- Серия: Advances in Dependability Engineering of Complex Systems
- Том: 582
- Год издания: 2017
- Место издания: Springer
- Первая страница: 166
- Последняя страница: 177
- DOI: 10.1007/978-3-319-59415-6_16
- Аннотация: The chapter introduces a comparative analysis of the complexity of the Tate pairing operation on a supersingular elliptic curve and the complexity of the final exponentiation in the tripartite key agreement cryptographic protocol. The analysis takes into account a possibility of using different bases of finite fields in combination. Operations of multiplication and multiple squaring in the field GF(2^n) and its 4-degree extension, of Tate pairing on supersingular elliptic curve and of final exponentiation are considered separately and in combination. We conclude that the best complexity bound for the pairing and the final exponentiation in the cryptographically significant field GF(2^191) is provided by the combination of the polynomial basis of this field and 1-type optimal basis of the field expansion.
- Добавил в систему: Гашков Сергей Борисович