New bit-parallel Montgomery multiplier for trinomials using squaring operation
2015; Elsevier BV; Volume: 52; Linguagem: Inglês
10.1016/j.vlsi.2015.09.007
ISSN1872-7522
Autores Tópico(s)Cryptography and Data Security
ResumoA new bit-parallel Montgomery multiplier for GF(2m) is presented, where the field is generated with an irreducible trinomial. We first present a slightly generalized version of a newly proposed divide and conquer approach. Then, by combining this approach and a carefully chosen Montgomery factor, we can implement field multiplication using a composition of small polynomial multiplications and Montgomery squarings, which are simpler and more efficient. As a result, the proposed multiplier roughly saves m22 logic gates compared with the fastest multipliers, with time complexity as good as or better than previous Karatsuba-based multipliers for the same class of fields.
Referência(s)