Author of the publication

A new bit-serial multiplier over GF(pm) using irreducible trinomials.

, , , , and . Comput. Math. Appl., 60 (2): 355-361 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Low complexity bit-parallel multiplier for F2n defined by repeated polynomials., , and . Discret. Appl. Math., (2018)New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2n)., , , , and . IEEE Trans. Very Large Scale Integr. Syst., 20 (10): 1903-1908 (2012)Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains., , , , , and . ACISP, volume 2727 of Lecture Notes in Computer Science, page 67-78. Springer, (2003)A Fast Inversion Algorithm and Low-Complexity Architecture over GF(2m)., , , , and . CIS (2), volume 3802 of Lecture Notes in Computer Science, page 1-8. Springer, (2005)Modified Serial Multipliers for Type-IV Gaussian Normal Bases., , , and . INDOCRYPT, volume 3797 of Lecture Notes in Computer Science, page 375-388. Springer, (2005)An efficient signed digit montgomery multiplication for RSA., , , , , and . J. Syst. Archit., 55 (7-9): 355-362 (2009)A new bit-serial multiplier over GF(pm) using irreducible trinomials., , , , and . Comput. Math. Appl., 60 (2): 355-361 (2010)A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm., , , and . ISC, volume 3650 of Lecture Notes in Computer Science, page 288-299. Springer, (2005)Modified Sequential Multipliers for Type-k Gaussian Normal Bases., , and . MUE, page 220-225. IEEE Computer Society, (2011)