Abstract

Redundant basis (RB) is one of the appealing representation systems for finite field arithmetic due to its specific features in providing cost-free squaring operation in hardware implementation and because it eliminates the need for modular reduction. In this brief, a new architecture for digit-level finite field multiplication in $\mathbb {F}_{2^{m}}$ using redundant representation is proposed. Contrary to previously presented redundant basis multipliers, in the proposed architecture one digit of each operand is concurrently fed into the multiplier at each clock cycle which, in turn, reduces the total number of the clock cycles required in the multiplication process. To draw an accurate comparison, the proposed multiplier together with several existing digit-level RB multipliers were fully implemented in 65-nm CMOS technology.

Full Text
Paper version not known

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 call

Disclaimer: 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.