Modular Multiplier based on Cellular Automata over $GF({2^m})$
(셀룰라 오토마타를 이용한 $GF({2^m})$ 상의 곱셈기$^1$ )
-
- Proceedings of the Korean Information Science Society Conference
- /
- 2001.10a
- /
- pp.709-711
- /
- 2001