Abstract
Pairing-based schemes, such as identity-based cryptosystem, are widely used for future computing environments. Hence the work of hardware architectures for G F ( p m ) has been brought to public attention for the past few years since most of the pairing-based schemes are implemented using arithmetic operations over G F ( p m ) defined by irreducible trinomials. This paper proposes a new most significant elements (MSE)-first serial multiplier for G F ( p m ) , where p > 2 , which is more efficient than least significant elements (LSE)-first multipliers from the point of view of both the time delay and the size of registers. In particular, the proposed multiplier has an advantage when the extension degree of finite fields m is large and the characteristic of finite fields p is small like G F ( 3 m ) , G F ( 5 m ) , and G F ( 7 m ) used in pairing-based cryptosystems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.