Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/12075
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Babenko, M. G. | - |
dc.contributor.author | Бабенко, М. Г. | - |
dc.contributor.author | Redvanov, A. S. | - |
dc.contributor.author | Редванов, А. С. | - |
dc.contributor.author | Deryabin, M. A. | - |
dc.contributor.author | Дерябин, М. А. | - |
dc.contributor.author | Chervyakov, N. I. | - |
dc.contributor.author | Червяков, Н. И. | - |
dc.contributor.author | Nazarov, A. S. | - |
dc.contributor.author | Назаров, А. С. | - |
dc.contributor.author | Al-Galda, S. C. | - |
dc.contributor.author | Аль-Гальда, С. Ч. | - |
dc.contributor.author | Vashchenko, I. S. | - |
dc.contributor.author | Ващенко, И. С. | - |
dc.contributor.author | Dvoryaninova, I. V. | - |
dc.contributor.author | Дворянинова, И. В. | - |
dc.contributor.author | Nepretimova, E. V. | - |
dc.contributor.author | Непретимова, Е. В. | - |
dc.date.accessioned | 2020-06-18T14:15:06Z | - |
dc.date.available | 2020-06-18T14:15:06Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Babenko, M., Redvanov, A.S., Deryabin, M., Chervyakov, N., Nazarov, A., Al-Galda, S.C., Vashchenko, I., Dvoryaninova, I., Nepretimova, E. Efficient implementation of cryptography on points of an elliptic curve in residue number system // 2019 International Conference on Engineering and Telecommunication, EnT 2019. - 2019. - Номер статьи 9030592 | ru |
dc.identifier.uri | http://hdl.handle.net/20.500.12258/12075 | - |
dc.description.abstract | The article explores the question of the effective implementation of arithmetic operations with points of an elliptic curve given over a prime field. Given that the basic arithmetic operations with points of an elliptic curve are the operations of adding points and doubling points, we study the question of implementing the arithmetic operations of adding and doubling points in various coordinate systems using the weighted number system and using the Residue Number System (RNS). We have shown that using the fourmodule RNS allows you to get an average gain for the operation of adding points of the elliptic curve of 8.67% and for the operation of doubling the points of the elliptic curve of 8.32% compared to the implementation using the operation of modular multiplication with special moduli from NIST FIPS 186 | ru |
dc.language.iso | en | ru |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | ru |
dc.relation.ispartofseries | 2019 International Conference on Engineering and Telecommunication, EnT 2019 | - |
dc.subject | Cryptography | ru |
dc.subject | Elliptic curve | ru |
dc.subject | Residue number system (RNS) | ru |
dc.subject | Geometry | ru |
dc.title | Efficient implementation of cryptography on points of an elliptic curve in residue number system | ru |
dc.type | Статья | ru |
vkr.inst | Институт информационных технологий и телекоммуникаций | ru |
vkr.inst | Институт математики и естественных наук | ru |
Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
File | Size | Format | |
---|---|---|---|
scopusresults 1246 .pdf Restricted Access | 128.08 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.