On the Complexity of non-recursive n-term Karatsuba Multiplier for Trinomials - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yin Li, Yu Zhang 0031, Xingpo Ma, Chuanda Qi. On the Complexity of non-recursive n-term Karatsuba Multiplier for Trinomials. IACR Cryptology ePrint Archive, 2019:111, 2019. [doi]

The following publications are possibly variants of this publication:

On the Complexity of Hybrid n-Term Karatsuba Multiplier for TrinomialsYin Li, Shantanu Sharma 0001, Yu Zhang 0031, Xingpo Ma, Chuanda Qi. tcas, 67-I(3):852-865, 2020. [doi]

N-Term Karatsuba Algorithm and its Application to Multiplier Designs for Special TrinomialsYin Li, Yu Zhang 0031, Xiaoli Guo, Chuanda Qi. access, 6:43056-43069, 2018. [doi]

N-term Karatsuba Algorithm and its Application to Multiplier designs for Special TrinomialsYin Li, Yu Zhang, Xiaoli Guo, Chuanda Qi. iacr, 2018:605, 2018. [doi]

Mastrovito Form of Non-Recursive Karatsuba Multiplier for All TrinomialsYin Li, Xingpo Ma, Yu Zhang, Chuanda Qi. TC, 66(9):1573-1584, 2017. [doi]

Mastrovito form of Karatsuba Multiplier for All TrinomialsYin Li, Xingpo Ma, Yu Zhang, Chuanda Qi. iacr, 2016:694, 2016. [doi]

Speedup of bit-parallel Karatsuba multiplier in GF(2:::m:::) generated by trinomialsYin Li, Gong-Liang Chen, Jian-hua Li. ipl, 111(8):390-394, 2011. [doi]

Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of TrinomialsYin Li, Yu Zhang, Xiaoli Guo. vlsi, 2018, 2018. [doi]

runs on WebDSL