Abstract
Chinese remainder theorem (CRT), an old and famous theorem, is widely used in many modern computer applications. The computation of CRT contains many similar operations which can be implemented concurrently. Here, a parallel algorithm implemented on the ring topology is proposed to parallelize almost all the computations in CRT and J-conditions in this paper. Some recently proposed modular arithmetic operations are stated and employed to accelerate the computation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
