Theoretical foundations of the modified perfect form of residue number system
DOI10.1007/S10559-016-9817-2zbMATH Open1358.68021OpenAlexW2322662350WikidataQ57665646 ScholiaQ57665646MaRDI QIDQ314995FDOQ314995
Authors: Ya. M. Nikolaĭchuk, M. M. Kasyanchuk, I. Z. Yakimenko 
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
Recommendations
- scientific article; zbMATH DE number 5899803
- A method for implementing the operation of modulo addition of the residues of two numbers in the residue number system
- Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
- scientific article; zbMATH DE number 2073523
- Residue number systems. Theory and implementation.
residue number systemChinese remainder theoremcomputing rangeinverse modulo elementmodified perfect formmodulo system
Cites Work
- 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
- Title not available (Why is that?)
Cited In (5)
- Residue number system asymmetric cryptoalgorithms
- Algorithms for solving problems of cryptographic protection of color image pixels in the Rademacher's basis and residue number systems
- Title not available (Why is that?)
- Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
- The application of core functions to residue number systems
This page was built for publication: Theoretical foundations of the modified perfect form of residue number system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314995)
