From post

Low-Complexity Digit-Serial Multiplier Over $GF(2^m)$ Based on Efficient Toeplitz Block Toeplitz Matrix-Vector Product Decomposition.

, , , и . IEEE Trans. Very Large Scale Integr. Syst., 25 (2): 735-746 (2017)

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.

 

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

Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials., , и . IEEE Trans. Computers, 50 (5): 385-393 (2001)A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model., , , , и . IEEE Trans. Computers, 63 (12): 2894-2904 (2014)Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures., , , и . IEEE Trans. Circuits Syst. II Express Briefs, 61-II (2): 125-129 (2014)Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach., , и . IEEE Trans. Circuits Syst. I Regul. Pap., 62-I (8): 2044-2051 (2015)Fault-tolerant Gaussian normal basis multiplier over GF(2m)., , , и . IET Inf. Secur., 6 (3): 157-170 (2012)Low-complexity Gaussian normal basis multiplier over GF(2m)., , , , , и . IET Inf. Secur., 6 (4): 310-317 (2012)Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)., , и . J. Electron. Test., 22 (2): 143-150 (2006)Concurrent error detection in semi-systolic dual basis multiplier over GF(2m) using self-checking alternating logic., , , , и . IET Circuits Devices Syst., 4 (5): 382-391 (2010)Low-complexity bit-parallel systolic multipliers over GF(2m).. Integr., 41 (1): 106-112 (2008)Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2m) Using Double Parity Prediction Scheme., , и . J. Signal Process. Syst., 58 (2): 233-246 (2010)