A note on Chang–Lai’s modular square algorithm based on the generalized Chinese remainder theorem

摘要

This paper focuses on two drawbacks on Chang–Lai’s modular square algorithm, the version of the modular square algorithm that uses the generalized Chinese remainder theorem to improve the parallel computational efficiency. According to our results, Chang–Lai’s algorithm is impractical from the application view.