Theoretical foundations of the modified perfect form of residue number system

DOI10.1007/s10559-016-9817-2zbMath1358.68021OpenAlexW2322662350WikidataQ57665646 ScholiaQ57665646MaRDI QIDQ314995

I. Z. Yakimenko, M. M. Kasyanchuk, Ya. M. Nikolaĭchuk

Publication date: 19 September 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9817-2

zbMATH Keywords

Chinese remainder theoremresidue number systemcomputing rangeinverse modulo elementmodified perfect formmodulo system

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (2)

Algorithms for solving problems of cryptographic protection of color image pixels in the Rademacher's basis and residue number systems ⋮ Residue number system asymmetric cryptoalgorithms

Cites Work

• Unnamed Item
• A mixed finite-element method in an eigenvalue problem of the nonlinear stability of shallow shells.
• Theory of reliable and secure data transmission in sensory and local area networks
• Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation

This page was built for publication: Theoretical foundations of the modified perfect form of residue number system