Better Circuits for Binary Polynomial Multiplication.

IEEE Trans Comput

Computer Security Division, National Institute of Standards and Technology, Gaithersburg, MD 20899.

Published: January 2019

We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over . We restrict the search of small circuits to a class of circuits we call ( ⊆ {0,…, - 1}). (), - = 4, 5, 6, - http://cs-www.cs.yale.edu/homes/peralta/CircuitStuff/BinPolMult.tar.gz.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6774206PMC
http://dx.doi.org/10.1109/TC.2018.2874662DOI Listing

Publication Analysis

Top Keywords

better circuits
4
circuits binary
4
binary polynomial
4
polynomial multiplication
4
multiplication develop
4
develop simple
4
simple describe
4
describe karatsuba-like
4
karatsuba-like algorithms
4
algorithms multiplication
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!