Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/3172
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chervyakov, N. I. | - |
dc.contributor.author | Червяков, Н. И. | - |
dc.contributor.author | Babenko, M. G. | - |
dc.contributor.author | Бабенко, М. Г. | - |
dc.contributor.author | Kuchukov, V. A. | - |
dc.contributor.author | Кучуков, В. А. | - |
dc.contributor.author | Deryabin, M. A. | - |
dc.contributor.author | Дерябин, М. А. | - |
dc.contributor.author | Kuchukova, N. N. | - |
dc.contributor.author | Кучукова, Н. Н. | - |
dc.date.accessioned | 2018-10-09T13:08:42Z | - |
dc.date.available | 2018-10-09T13:08:42Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Chervyakov, N.I., Babenko, M.G., Kuchukov, V.A., Deryabin, M.A., Kuchukova, N.N., Tchernykh, A.N. Fast modular multiplication execution in residue number system // 2016 IEEE Conference on Quality Management, Transport and Information Security, Information Technologies, IT and MQ and IS 2016. - Номер статьи 7751894. - Pages 30-32 | ru |
dc.identifier.uri | https://www.scopus.com/record/display.uri?eid=2-s2.0-85006857205&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=2d4e826478140d99650a215e37019390&sot=aff&sdt=cl&cluster=scopubyr%2c%222016%22%2ct&sl=174&s=AF-ID%28%22North+Caucasus+Federal+University%22+60070541%29+OR+AF-ID%28%22Stavropol+State+University%22+60070961%29+OR+AF-ID%28%22stavropolskij+Gosudarstvennyj+Tehniceskij+Universitet%22+60026323%29&relpos=10&citeCnt=0&searchTerm= | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12258/3172 | - |
dc.description.abstract | In the paper, we propose a new method of modular multiplication computation, based on Residue Number System. We use an approximate method to find the approximate method a residue from division of a multiplication on the given module. We substitute expensive modular operations, by fast bit right shift operations and taking low bits. The carried-out simulation on Kintex7 XC7K70T board showed that the offered method allows to win in time on average for 75%, and in the area-on average for 80% relatively to modified method from work [1] that makes it more applicable for the hardware implementation of the cryptography primitives constructed over a simple finite field | ru |
dc.language.iso | en | ru |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | ru |
dc.relation.ispartofseries | 2016 IEEE Conference on Quality Management, Transport and Information Security, Information Technologies, IT and MQ and IS 2016 | - |
dc.subject | Approximate method | ru |
dc.subject | FPGA | ru |
dc.subject | Montgomery algorithm | ru |
dc.subject | Residue number system (RNS) | ru |
dc.subject | Quality management | ru |
dc.title | Fast modular multiplication execution in residue number system | ru |
dc.type | Статья | ru |
vkr.amount | Pages 30-32 | ru |
vkr.inst | Институт математики и естественных наук | - |
Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
scopusresults 406 .pdf Restricted Access | 63.29 kB | Adobe PDF | View/Open | |
WoS 245 .pdf Restricted Access | 2.58 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.