Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
From MaRDI portal
Publication:2263333
Recommendations
- Theoretical foundations of the modified perfect form of residue number system
- scientific article; zbMATH DE number 1979683
- Employing the linear transformation and the algebraic complement in numerical systems
- On Translation Algorithms in Residue Number Systems
- Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)
Cited in
(4)- Algorithms for solving problems of cryptographic protection of color image pixels in the Rademacher's basis and residue number systems
- Symmetric encryption algorithms in a polynomial residue number system
- Theoretical foundations of the modified perfect form of residue number system
- Employing the linear transformation and the algebraic complement in numerical systems
This page was built for publication: Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263333)