Abstract
The paper presents an efficient exponent architecture for public-key cryptosystems in the finite field GF(2m). Multiplication is the key operation in implementing circuits for cryptosystems, as the process of encrypting and decrypting a message requires modular exponentiation, which can be decomposed into repeated multiplications. Exponentiation is implemented more efficiently by repeatedly applying AB2 multiplications rather than AB multiplications. Thus, effective AB2 multiplication algorithms and simple architectures are the key for implementing exponentiations. Accordingly, the paper proposes an efficient inner product multiplication algorithm using an irreducible all one polynomial (AOP) and simple architecture. Furthermore, the proposed bit-serial multiplication algorithm and architecture are highly regular and simpler than those in previous studies.
Sign-in/Register to access full text options 
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.
