Welcome to the resource topic for 2016/694
Title:
Mastrovito Form of Non-recursive Karatsuba Multiplier for All Trinomials
Authors: Yin Li, Xingpo Ma, Yu Zhang, Chuanda Qi
Abstract:We present a new type of bit-parallel non-recursive Karatsuba multiplier over GF(2^m) generated by an arbitrary irreducible trinomial. This design effectively exploits Mastrovito approach and shifted polynomial basis (SPB) to reduce the time complexity and Karatsuba algorithm to reduce its space complexity. We show that this type of multiplier is only one T_X slower than the fastest bit-parallel multiplier for all trinomials, where T_X is the delay of one 2-input XOR gate. Meanwhile, its space complexity is roughly 3/4 of those multipliers. To the best of our knowledge, it is the first time that our scheme has reached such a time delay bound. This result outperforms previously proposed non-recursive Karatsuba multipliers.
ePrint: https://eprint.iacr.org/2016/694
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 .