| 2005 |
|---|
| 11 | EE | Pin-Chang Su,
Henry Ker-Chang Chang,
Erl-Huei Lu:
ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem.
Applied Mathematics and Computation 164(3): 757-772 (2005) |
| 10 | EE | Pin-Chang Su,
Erl-Huei Lu,
Henry Ker-Chang Chang:
A knapsack public-key cryptosystem based on elliptic curve discrete logarithm.
Applied Mathematics and Computation 168(1): 40-46 (2005) |
| 9 | EE | Henry Ker-Chang Chang,
Erl-Huei Lu,
Pin-Chang Su:
Design of traceable security system.
Applied Mathematics and Computation 168(2): 933-944 (2005) |
| 8 | EE | Henry Ker-Chang Chang,
Erl-Huei Lu,
Pin-Chang Su:
Fail-stop blind signature scheme design based on pairings.
Applied Mathematics and Computation 169(2): 1324-1331 (2005) |
| 2000 |
|---|
| 7 | | Henry Ker-Chang Chang,
Jing-Jang Hwang,
Hsing-Hua Liu:
A novel access control method using Morton number and prime factorization.
Inf. Sci. 130(1-4): 23-40 (2000) |
| 1996 |
|---|
| 6 | | Henry Ker-Chang Chang,
Chung-Yu Liou:
A Constant Key Length Coding Scheme for Linear Quadtrees.
International Journal of Geographical Information Science 10(2): 205-218 (1996) |
| 5 | EE | Shyong Jian Shyu,
Henry Ker-Chang Chang,
Kro-Chien Chou:
Implementation of a Linear Quadtree Coding Scheme on the Parallel Virtual Machine.
International Journal of High Speed Computing 8(1): 65-79 (1996) |
| 1995 |
|---|
| 4 | EE | Henry Ker-Chang Chang,
Shing Hong Chen:
A Locally Adaptive Coding Scheme for Chinese Text Files.
J. Inf. Sci. Eng. 11(1): 51-71 (1995) |
| 1994 |
|---|
| 3 | | Henry Ker-Chang Chang,
Jonathan Jen-Rong Chen,
Shyong Jian Shyu:
A Parallel Algorithm for the Knapsack Problem Using a Generation and Searching Technique.
Parallel Computing 20(2): 233-243 (1994) |
| 1993 |
|---|
| 2 | | Henry Ker-Chang Chang,
Shing Hong Chen:
A New Locally Adaptive Data Compression Scheme using Multilist Structure.
Comput. J. 36(6): 570-578 (1993) |
| 1992 |
|---|
| 1 | EE | Henry Ker-Chang Chang,
Jonathan Jen-Rong Chen:
A Parallel Algorithm for the Knapsack Problem with Memory/Processor Tradeoff M2P = O(2n/2).
International Journal of High Speed Computing 4(2): 109-120 (1992) |
