- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c4 |      | Chia-Long Wu: Modular Arithmetic and Fast Algorithm Designed for Modern Computer Security Applications. ACIIDS (3) 2012: 276-285 |
| 2010 | ||
| j14 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: Fast modular multiplication based on complement representation and canonical recoding. Int. J. Comput. Math. 87(13): 2871-2879 (2010) |
| 2009 | ||
| j13 | | Te-Jen Chang, Chia-Long Wu, Der-Chyuan Lou, Ching-Yin Chen: A low-complexity LUT-based squaring algorithm. Computers & Mathematics with Applications 57(9): 1494-1501 (2009) |
| j12 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: Computational Reduction of Wilson's Primality Test for Modern Cryptosystems. Informatica (Slovenia) 33(4): 453-458 (2009) |
| j11 | | Chia-Long Wu: An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation. Inf. Sci. 179(4): 410-421 (2009) |
| c3 | | Chia-Long Wu: Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique. ICA3PP 2009: 428-438 |
| 2008 | ||
| c2 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: Fast Modular Multiplication for E-Commerce Cryptosystem. ISDA (3) 2008: 457-461 |
| c1 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: An efficient Montgomery exponentiation algorithm for public-key cryptosystems. ISI 2008: 284-285 |
| 2007 | ||
| j10 | | Der-Chyuan Lou, Jui-Chang Lai, Chia-Long Wu, Te-Jen Chang: An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques. Applied Mathematics and Computation 185(1): 31-44 (2007) |
| j9 | | Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Jen Chang: Fast modular multi-exponentiation using modified complex arithmetic. Applied Mathematics and Computation 186(2): 1065-1074 (2007) |
| j8 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: Fast binary multiplication by performing dot counting and complement recoding. Applied Mathematics and Computation 191(1): 132-139 (2007) |
| j7 |  | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang, Shih-Yun Chen: Integer factorization for RSA cryptosystem under a PVM environment. Comput. Syst. Sci. Eng. 22(1-2) (2007) |
| j6 | | Chia-Long Wu: Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques. Int. J. Comput. Math. 84(10): 1405-1415 (2007) |
| 2006 | ||
| j5 | | Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Jen Chang: Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem. Informatica, Lith. Acad. Sci. 17(3): 445-462 (2006) |
| 2005 | ||
| j4 | | Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang: An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications. Informatica, Lith. Acad. Sci. 16(3): 449-468 (2005) |
| 2004 | ||
| j3 | | Der-Chyuan Lou, Chia-Long Wu: Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques. Int. J. Comput. Math. 81(10): 1187-1202 (2004) |
| 2003 | ||
| j2 | | Der-Chyuan Lou, Chia-Long Wu, Ching-Yin Chen: Fast exponentiation by folding the signed-digit exponent in half. Int. J. Comput. Math. 80(10): 1251-1259 (2003) |
| 2002 | ||
| j1 | | Der-Chyuan Lou, Chia-Long Wu, Rong-yi Ou: Application of Parallel Virtual Machine Framework to the Strong Prime Problem. Int. J. Comput. Math. 79(7): 797-806 (2002) |
| 1 | Te-Jen Chang | |
| 2 | Ching-Yin Chen | |
| 3 | Shih-Yun Chen | |
| 4 | Jui-Chang Lai | |
| 5 | Der-Chyuan Lou | |
| 6 | Rong-yi Ou |
Data released under the ODC-BY 1.0 license — See also our legal information page