References
- Diffie, W. and Hellman, M. E., "New directions in cryptography," IEEE Transaction Information Theory, Vol.22, No.6, 1976, pp.644-654. https://doi.org/10.1109/TIT.1976.1055638
- Kobliz, N., "Elliptic curve cryptography," Mathematics of Computation, Vol.48, No.177, 1987, pp.203-209. https://doi.org/10.1090/S0025-5718-1987-0866109-5
-
Lee, C. Y., Chiou, C. W. and Lin, J. M., "Concurrent error detection in a polynomial basis multiplier over GF(
$2^m$ )," Journal of Electronic Testing, Vol.22, No.2, 2006, pp.143-150. https://doi.org/10.1007/s10836-006-7446-9 -
Chiou, C. W., Lee, C. Y., Deng, A. W. and Lin, J. M., "Concurrent error detection in Montgomery multiplication over GF(
$2^m$ )," IEICE Transactions on Fundamentals of Electronics, Vol.E89-A, No.2, 2006, pp.566-574. https://doi.org/10.1093/ietfec/e89-a.2.566 -
Huang, W. T., Chang, C. H., Chiou, C. W. and Chou, F. H., "Concurrent error detection and correction in a polynomial basis multiplier over GF(
$2^m$ )," IET Information Security, Vol.4, No.3, 2010, pp.111-124. https://doi.org/10.1049/iet-ifs.2009.0160 -
Kim, K. W. and Kim, S. H., "A low latency semi-systolic multiplier over GF(
$2^m$ )," IEICE Electronics Express, Vol.10, No.13, 2013, p.20130354. https://doi.org/10.1587/elex.10.20130354 -
Choi, S. H. and Lee, K. J., "Efficient systolic modular multiplier/squarer for fast exponentiation over GF(
$2^m$ )," IEICE Electronics Express, Vol.12, No.11, 2015, p.20150222. https://doi.org/10.1587/elex.12.20150222 - Chiou, C. W., Lee, C. M., Sun, Y. S., Lee, C. Y. and Lin, J. M., "High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems," IET Computers & Digital Techniques, Vol.12, No.5, 2018, pp.187-191. https://doi.org/10.1049/iet-cdt.2017.0209
- Lee, H. H. and Kim, K. W., "Efficient semi-systolic finite field multiplier using redundant basis," International Scholarly and Scientific Research & Innovation, Vol.10, No.10, 2016, pp.1563-1567.
-
Mathe, S. E. and Boppana, L., "Design and implementation of a sequential polynomial basis multiplier over GF(
$2^m$ )," KSII Transactions on Internet and Information Systems, Vol.11, No.4, 2017, pp.2680-2700. -
Ibrahim, A., "Efficient parallel and serial systolic structures for multiplication and squaring over GF(
$2^m$ )," Canadian Journal of Electrical and Computer Engineering, Vol.42, No.2, 2019, pp.114-120. https://doi.org/10.1109/CJECE.2019.2900087 - Montgomery, P. L., "Modular multiplication without trial division," Mathematics of Computation, Vol.44, No.170, 1985, pp.519-521. https://doi.org/10.1090/S0025-5718-1985-0777282-X
-
Koc, C. K. and Acar, T., "Montgomery multiplication in GF(
$2^k$ )," Designs Codes and Cryptography, Vol.14, No.1, 1998, pp.57-69. https://doi.org/10.1023/A:1008208521515 -
Lee, W. H., Lee, K. J. and Yoo, K. Y., "New digit-serial systolic arrays for power-sum and division operation in GF(
$2^m$ )," Lecture Notes in Computer Science, Vol.3045, 2004, pp.638-647.