Abstract
This paper presents a fast parallel garner algorithm for Chinese remainder theorem. The variables in garner algorithm are divided into public parameters that are constants for fixed module and private parameters that represent random input integers. We design the parallel garner algorithm by analyzing the data dependencies of these arithmetic operations for computing public variables and private variables. Time complexities and speedup ratios of the parallel algorithm and the sequential algorithm are calculated to make the quantitative comparison based on our previous work about some fundamental parallel algorithms. The performance evaluation shows high efficiency of the proposed parallel algorithm compared to the sequential one.
Chapter PDF
Similar content being viewed by others
References
Wikipedia, http://en.wikipedia.org/wiki/Chinese_remainder_theorem
Chen, H.: CRT-based high-speed parallel architecture for long BCH encoding. IEEE Transactions on Circuits and Systems II: Express Briefs 56(8), 684–686 (2009)
Sundaram, S., Hadjicostis, C.N.: Fault-tolerant convolution via Chinese remainder codes constructed from non-coprime moduli. IEEE Transactions on Signal Processing 56(9), 4244–4254 (2008)
Abdelfattah, O., Swidan, A., Zilic, Z.: Direct residue-to-analog conversion scheme based on Chinese remainder theorem. In: 2010 IEEE International Conference on Electronics, Circuits, and Systems, pp. 687–690. IEEE Press, Athens (2010)
Hariri, A., Navi, K., Rastegar, R.: A new high dynamic range moduli set with efficient reverse converter. Computers and Mathematics with Applications 55(4), 660–668 (2008)
Bi, S., Gross, W.J.: The mixed-radix Chinese remainder theorem and its applications to residue comparison. IEEE Transactions on Computers 57(12), 1624–1632 (2008)
Zhou, J., Ou, Y.-h.: Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme. In: Hua, A., Chang, S.-L. (eds.) ICA3PP 2009. LNCS, vol. 5574, pp. 254–265. Springer, Heidelberg (2009)
Wen, T.Z.: Analyzing euler-fermat theorem based multicast key distribution schemes with Chinese remainder theorem. In: 2008 IFIP International Conference on Network and Parallel Computing, pp. 11–17. IEEE Press, Shanghai (2008)
Song, B., Ito, Y., Nakano, K.: CRT-based DSP decryption using montgomery modular multiplication on the FPGA. In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp. 532–541. IEEE Press, Anchorage (2011)
Li, Y., Xiao, L., Chen, S., Tian, H., Ruan, L., Yu, B.: Parallel Extended Basic Operations for Conic Curves Cryptography over Ring Zn. In: 9th IEEE International Symposium on Parallel and Distributed Processing with Applications Workshops, pp. 203–209. IEEE Press, Busan (2011)
Li, Y., Xiao, L., Qin, G., Li, X., Lei, S.: Comparison of Three Parallel Point-Multiplication Algorithms on Conic Curves. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011, Part II. LNCS, vol. 7017, pp. 43–53. Springer, Heidelberg (2011)
Li, Y., Xiao, L., Hu, Y., Liang, A., Tian, L.: Parallel algorithms for cryptosystem on conic curves over finite field Fp. In: 9th International Conference on Grid and Cloud Computing, pp. 163–167. IEEE Press, Nanjing (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Li, Y., Xiao, L., Liang, A., Zheng, Y., Ruan, L. (2012). Fast Parallel Garner Algorithm for Chinese Remainder Theorem. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-35606-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35605-6
Online ISBN: 978-3-642-35606-3
eBook Packages: Computer ScienceComputer Science (R0)