GF($2^m$ )상의 셀룰라 오토마타를 이용한 VLSI 구조
Vol. 12, No. 3, pp. 87-94,
6월.
2002
10.13089/JKIISC.2002.12.3.87, Full Text:
Keywords: 공개키 암호화 시스템, 표준기저, 샐룰라 오토마타, MSB 우선 곱셈, Public-key Cryptosystem, standard basis, cellular automata, AOP(All One Polynomial), Most Significant Bit first multiplication
Abstract Statistics
Cite this article
10.13089/JKIISC.2002.12.3.87, Full Text:
Keywords: 공개키 암호화 시스템, 표준기저, 샐룰라 오토마타, MSB 우선 곱셈, Public-key Cryptosystem, standard basis, cellular automata, AOP(All One Polynomial), Most Significant Bit first multiplication
Abstract Statistics
Cite this article
[IEEE Style]
전준철, 김현성, 이형목, 유기영, "Cellular Automata based on VLSI architecture over GF($2^m$ )," Journal of The Korea Institute of Information Security and Cryptology, vol. 12, no. 3, pp. 87-94, 2002. DOI: 10.13089/JKIISC.2002.12.3.87.
[ACM Style]
전준철, 김현성, 이형목, and 유기영. 2002. Cellular Automata based on VLSI architecture over GF($2^m$ ). Journal of The Korea Institute of Information Security and Cryptology, 12, 3, (2002), 87-94. DOI: 10.13089/JKIISC.2002.12.3.87.