| 2009 |
|---|
| 11 | EE | Chia-Long Wu:
An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation.
Inf. Sci. 179(4): 410-421 (2009) |
| 2008 |
|---|
| 10 | EE | Chia-Long Wu,
Der-Chyuan Lou,
Te-Jen Chang:
An efficient Montgomery exponentiation algorithm for public-key cryptosystems.
ISI 2008: 284-285 |
| 2007 |
|---|
| 9 | EE | 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) |
| 8 | EE | 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) |
| 7 | EE | 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) |
| 6 | EE | 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 |
|---|
| 5 | EE | 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 |
|---|
| 4 | EE | 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 |
|---|
| 3 | EE | 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 |
|---|
| 2 | EE | Der-Chyuan Lou,
Chia-Long Wu,
Chin-Yin Chen:
Fast exponentiation by folding the signed-digit exponent in half.
Int. J. Comput. Math. 80(10): 1251-1259 (2003) |
| 2002 |
|---|
| 1 | EE | 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) |
