 | 2010 |
|---|
| 10 |       | 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 |
|---|
| 9 | | 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) |
| 8 | | 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) |
| 2008 |
|---|
| 7 | | Chia-Long Wu,
Der-Chyuan Lou,
Te-Jen Chang:
Fast Modular Multiplication for E-Commerce Cryptosystem.
ISDA (3) 2008: 457-461 |
| 6 | | Chia-Long Wu,
Der-Chyuan Lou,
Te-Jen Chang:
An efficient Montgomery exponentiation algorithm for public-key cryptosystems.
ISI 2008: 284-285 |
| 2007 |
|---|
| 5 | | 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) |
| 4 | | 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) |
| 3 | | 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) |
| 2006 |
|---|
| 2 | | 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 |
|---|
| 1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page