U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Better Circuits for Binary Polynomial Multiplication

Published

Author(s)

Rene C. Peralta, Magnus G. Find

Abstract

We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over GF2. These techniques, along with interpolation-based recurrences, yield circuits that are better (smaller and with lower depth) than anything previously known. We use our optimization tools to actually build the circuits for n-term binary polynomial multiplication for values of n of practical interest.
Citation
IEEE Transactions on Computers
Volume
68
Issue
4
Pub Type
Journals

Download Paper

https://doi.org/10.1109/TC.2018.2874662

Keywords

Binary polynomial multiplication, circuits, symmetric bilinear circuits
Cybersecurity

Citation

Peralta, R. and Find, M. (2019), Better Circuits for Binary Polynomial Multiplication, IEEE Transactions on Computers, [online], https://doi.org/10.1109/TC.2018.2874662 (Accessed April 20, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created April 1, 2019, Updated May 1, 2019