A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli

Applied Mathematics and Computation

Volumn 161, Issue 1, 2005, Pages 181-194

  Chang, Chin Chen ^a   Lai, Yeu Pong ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Chinese remainder theorem; Generalized Chinese remainder theorem; Modular arithmetic

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONCURRENCY CONTROL; CRYPTOGRAPHY; PROBLEM SOLVING;

CHINESE REMAINDER THEOREM; EXPONENTIATION; GENERALIZED CHINESE REMAINDER THEOREM (GCRT); MODULAR ARITHMETIC;

THEOREM PROVING;

EID: 9544230687     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2003.12.018     Document Type: Article

References (9)

1. C.C. Chang, H.C. Lee, A new generalized group-oriented cryptoscheme without trusted centers, IEEE Journal on Selected Areas in Communications 11 (1993) 725-729.
2. C.C. Chang, C.H. Lin, A cryptosystem for secure broadcasting, Proceedings of National Science Council 12 (4) (1988) 233-239.
3. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31 (1985) 469-472.
4. A. Hayashi, A new fast modular multiplication method and its application to modular exponentiation-based cryptography, Electronics and Communications in Japan 83 (12) (2000) 88-93.
5. M. Joye, S.M. Yen, Optimal left-to-right binary signed-digit recoding, IEEE Transactions on Computers 49 (7) (2000) 740-748.
6. Koblitz, A Course in Number Theory and Cryptography, Springer, 1987.
7. D. Maulik, Root sets of polynomials modulo prime powers, Journal of Combinatorial Theory 93 (2001) 125-140.
8. W. McGovern, Rings of quotients of f-rings by Gabriel filters of ideals. Ph.D. Dissertation, Department of Mathematics, University of Florida, 1997.
9. R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978) 120-126.