Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system

DOI10.1007/s00224-021-10035-yOpenAlexW3153832319MaRDI QIDQ2230727

Mikhail Selianinau

Publication date: 28 September 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-021-10035-y

zbMATH Keywords

Chinese remainder theoremresidue number systemmixed-radix representationnon-modular operationsrank of a number

Mathematics Subject Classification ID

Computer system organization (68Mxx) Communication, information (94Axx) Computational number theory (11Yxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• RNS architectures for the implementation of the `diagonal function'
• Core function of an RNS number with no ambiguity
• AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
• Modular multiplication using the core function in the residue number system
• Residue Number Systems
• Embedded Systems Design with Special Arithmetic and Number Systems
• The application of core functions to residue number systems
• Generation of integral characteristics of symmetric-range residue codes
• Fast base extension using a redundant modulus in RNS
• Binary Logic for Residue Arithmetic Using Magnitude Index

This page was built for publication: Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system