Residue number system asymmetric cryptoalgorithms
From MaRDI portal
Publication:2103804
DOI10.1007/S10559-022-00494-7zbMATH Open1504.94176OpenAlexW4306693000MaRDI QIDQ2103804FDOQ2103804
Authors: Ya. M. Nykolaychuk, I. Z. Yakymenko, N. Ya. Vozna, M. M. Kasianchuk
Publication date: 9 December 2022
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-022-00494-7
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Cites Work
- Theoretical foundations of the modified perfect form of residue number system
- A brief introduction to distributed systems
- An Introduction to Mathematical Cryptography
- Symmetric cryptoalgorithms in the residue number system
- New models and methods for estimating the cryptographic strength of information security systems
- Residue number systems. Theory and applications
- Algorithms for solving problems of cryptographic protection of color image pixels in the Rademacher's basis and residue number systems
- An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier
- Successful cryptanalytic attacks upon RSA moduli \(N=pq\)
Cited In (2)
This page was built for publication: Residue number system asymmetric cryptoalgorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103804)