High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function
摘要
The Residue Number System is widely used in cryptography, digital signal processing, image processing systems and other areas where high-performance computation is required. One of the computationally expensive operations in the Residue Number System is the parity detection of a number. This paper presents a high-speed algorithm for parity detection of numbers in Residue Number System based on Akushsky core function. The proposed approach for parity detection reduces the average time by 20.39% compared to the algorithm based on the Chinese Remainder Theorem.