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.

 

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

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)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)Speaker Recognition in an Emotionalized Spontaneous Speech Using Empirical Mode Decomposition., , и . IMECS, стр. 387-392. Newswood Limited, (2007)New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm., , и . APCCAS, стр. 610-613. IEEE, (2006)Supporting Physical Agents in an Interactive e-book., , , и . ICGEC (2), том 388 из Advances in Intelligent Systems and Computing, стр. 243-252. Springer, (2015)Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)., , , , и . IEEE Trans. Computers, 58 (6): 851-857 (2009)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)Feature selection algorithm for ECG signals using Range-Overlaps Method., , и . Expert Syst. Appl., 37 (4): 3499-3512 (2010)Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m2) using all one polynomial., , и . Inf. Process. Lett., 111 (21-22): 1044-1047 (2011)