| Journal of Algorithms |
Fast Euclid’s GCD algorithm without magnitude comparison |
第一作者 |
2005/01 |
| WSEAS Transactions on Information Science & Applications |
Low-Complexity Sequential Berlekamp-Like Multiplier for All Trinomials |
第二作者 |
2005/01 |
| WSEAS Transactions on Computers |
Flexible Sequential Multiplier In Normal basis of GF(2^m) |
第二作者 |
2005/01 |
| Computers & Security |
Multiplexer-Based Double-Exponentiation for Normal Basis of GF (2^m) |
第一作者 |
2005/01 |
| Information and Software Technology |
Encapsulating Windows-Based Software Applications into Reusable Components using Pattern Language |
第一作者 |
2005/01 |
| WSEAS Transactions on Computers |
A Survival Array Multiplier Over GF(2^m) Under Faults |
第一作者 |
2005/01 |
| Computers & Electrical Engineering |
Low-Complexity Bit-Parallel Dual Basis Multipliers Using the Modified Booth’s Algorithm |
第二作者 |
2005/01 |
