From post

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.

 

Другие публикации лиц с тем же именем

New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm., , и . APCCAS, стр. 610-613. IEEE, (2006)Speaker Recognition in an Emotionalized Spontaneous Speech Using Empirical Mode Decomposition., , и . IMECS, стр. 387-392. Newswood Limited, (2007)Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination., , и . ICGEC (2), том 388 из Advances in Intelligent Systems and Computing, стр. 187-200. Springer, (2015)Unified Parallel Systolic Multiplier Over GF(2m)., , , и . 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., , , , , и . 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)., и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 88-A (11): 3169-3179 (2005)High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems., , , , и . IET Comput. Digit. Tech., 12 (5): 187-191 (2018)Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)., , , и . IET Inf. Secur., 6 (4): 324-328 (2012)Self-checking alternating logic bit-parallel gaussian normal basis multiplier with type-t., , и . IET Inf. Secur., 5 (1): 33-42 (2011)Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t., , , , , и . IET Inf. Secur., 6 (4): 318-323 (2012)