Author of the publication

Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m).

, , and . J. Electron. Test., 22 (2): 143-150 (2006)

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

New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm., , and . APCCAS, page 610-613. IEEE, (2006)Speaker Recognition in an Emotionalized Spontaneous Speech Using Empirical Mode Decomposition., , and . IMECS, page 387-392. Newswood Limited, (2007)Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination., , and . ICGEC (2), volume 388 of Advances in Intelligent Systems and Computing, page 187-200. Springer, (2015)Unified Parallel Systolic Multiplier Over GF(2m)., , , and . J. Comput. Sci. Technol., 22 (1): 28-38 (2007)Gaussian normal basis multiplier over GF(2 m ) using hybrid subquadratic-and-quadratic TMVP approach for elliptic curve cryptography., , , , , and . IET Circuits Devices Syst., 11 (6): 579-588 (2017)Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 88-A (11): 3169-3179 (2005)High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems., , , , and . IET Comput. Digit. Tech., 12 (5): 187-191 (2018)Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)., , , and . IET Inf. Secur., 6 (4): 324-328 (2012)Self-checking alternating logic bit-parallel gaussian normal basis multiplier with type-t., , and . IET Inf. Secur., 5 (1): 33-42 (2011)Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t., , , , , and . IET Inf. Secur., 6 (4): 318-323 (2012)