Abstract
In this paper a systolic Multiplication-Inversion architecture is proposed that can be extended to perform all GF(2k) field operations. This architecture is based on a proposed Modified version of the Extended Euclidean Algorithm that through appropriate reusability and initialization it can perform multiplication and inversion. Therefore, while other known designs need two hardware components for multiplication and inversion, in the proposed design only one hardware module for both operations is used that give very interesting results in terms of Area complexity, critical path delay, latency and throughput.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
