A Scalable Architecture for Multiplier over Finite Fields GF(2 m ) *Kwang-Jin Lee, *Yong-Hee Jang , *Yong- Jin Kwon . Telecommunication and Information Eng. Hankuk Aviation University Logic Circuit Lab. Hankuk Aviation Univ. Logic Circuit Lab. Hankuk Aviation Univ.
17
Embed
A Scalable Architecture for Multiplier over Finite Fields GF (2 m )
A Scalable Architecture for Multiplier over Finite Fields GF (2 m ). *Kwang-Jin Lee, *Yong-Hee Jang , *Yong-Jin Kwon. Dept. Telecommunication and Information Eng. Hankuk Aviation University. Logic Circuit Lab. Hankuk Aviation Univ. Overview. Introduction - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
A Scalable Architecture for Multiplier over Finite Fields GF(2m)
*Kwang-Jin Lee, *Yong-Hee Jang , *Yong-Jin Kwon
Dept. Telecommunication and Information Eng. Hankuk Aviation University
Importance of multiplication over GF(2m) Problem on current multipliers over GF(2m) Scalable architecture
Multiplication Algorithm over GF(2m) for Scalable Architecture Scalable Architecture for Multiplier over GF(2m)
Structure of PE(Processing Element) Pipeline organization Memory organization
Evaluation and Analysis of the proposed architecture for multiplier Analysis of execution time by hardware configuration Comparison of the execution time
Conclusion We proposed a scalable architecture for multiplier
over GF(2m) which does not need to be redesigned when the precision is increased MSB-First multiplication method Bit-serial by word multiplication method Less execution time compare to the current system in