Paper 2019/111
On the Complexity of non-recursive -term Karatsuba Multiplier for Trinomials
Yin Li, Shantanu Sharma, Yu Zhang, Xingpo Ma, and Chuanda Qi
Abstract
The
Note: we add new paragraph, fix some errors
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I
- Keywords
- Bit-parallel multiplier
-Karatsuba algorithmshifted polynomial basisoptimaltrinomials - Contact author(s)
- yunfeiyangli @ gmail com
- History
- 2019-12-03: last of 2 revisions
- 2019-02-06: received
- See all versions
- Short URL
- https://ia.cr/2019/111
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/111, author = {Yin Li and Shantanu Sharma and Yu Zhang and Xingpo Ma and Chuanda Qi}, title = {On the Complexity of non-recursive $n$-term Karatsuba Multiplier for Trinomials}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/111}, year = {2019}, url = {https://eprint.iacr.org/2019/111} }