Analysis approaches to construction of arithmetic coprocessors for problems of elliptic cryptography
The article analyzes the methods of finding residue on a large prime modulus and describes an algorithm developed by the authors of the operation to find the residue of a large simple module in the system of residual classes using the approximate method of performing non-modular operations.
Saved in:
Main Authors: | Michail Grigorievich Babenko, Natalia Nikolaevna Vershkova, Nikolaj Nikolaevich Kucherov |
---|---|
Format: | Article |
Language: | Russian |
Published: |
North-Caucasus Federal University
2022-09-01
|
Series: | Наука. Инновации. Технологии |
Subjects: | |
Online Access: | https://scienceit.elpub.ru/jour/article/view/566 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Development of the algorithm coding alphabet by points of the elliptic curve
by: Michail Grigorievich Babenko, et al.
Published: (2022-09-01) -
On the property of divisibility points of elliptic curves over finite fields on two
by: Michail Grigorievich Babenko, et al.
Published: (2022-09-01) -
THE USE OF ERROR-CORRECTING CODES FOR THE DIAGNOSIS OF RNS MODULAR PROCESSORS
by: Nikolay Ivanovich Chervyakov, et al.
Published: (2022-09-01) -
ALGEBRAIC AND PRACTICAL ASPECTS OF THE IMPLEMENTATION OF THE NEURAL NETWORK THRESHOLD SECRET SHARING SCHEME
by: Nikolay Ivanovich Chervyakov, et al.
Published: (2022-09-01) -
THE USE OF FRACTIONAL UNITS FOR APPROXIMATE CALCULATION METHOD OF POSITIONAL SPECIFICATIONS
by: Irina Lavrynenko, et al.
Published: (2022-09-01)