A Fast Modular Square Computing Method Based on The Generalized Chinese Remainder Theorem for Prime Module

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6560

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6560

Title:	A Fast Modular Square Computing Method Based on The Generalized Chinese Remainder Theorem for Prime Module
Authors:	Chang, C. C.;Lai, Y. P
Date:	2005-02
Issue Date:	2009-12-17 06:58:38 (UTC+0)
Publisher:	Asia University
Relation:	Applied Mathematics and Computation 161(1):181-194
Appears in Collections:	[資訊工程學系] 期刊論文

Files in This Item:

There are no files associated with this item.