Welcome to the resource topic for 2017/836
Title:
Efficient Square-based Montgomery Multiplier for All Type C.1 Pentanomials
Authors: Yin Li, Xingpo Ma, Qin Chen, Chuanda Qi
Abstract:In this paper, we present a low complexity bit-parallel Montgomery multiplier for GF(2^m) generated with a special class of irreducible pentanomials x^m+x^{m-1}+x^k+x+1. Based on a combination of generalized polynomial basis (GPB) squarer and a newly proposed square-based divide and conquer approach, we can partition field multiplications into a composition of sub-polynomial multiplications and Montgomery/GPB squarings, which have simpler architecture and thus can be implemented efficiently. Consequently, the proposed multiplier roughly saves 1/4 logic gates compared with the fastest multipliers, while the time complexity matches previous multipliers using divide and conquer algorithms.
ePrint: https://eprint.iacr.org/2017/836
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .