Better Circuits for Binary Polynomial Multiplication

DOI10.1109/TC.2018.2874662MaRDI QIDQ5228929zbMATH OpenWikidataFDO

Authors René Peralta, Magnus Find

Publication date 13 August 2019

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2018.2874662

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
• Multiplication

This page was built for publication: Better Circuits for Binary Polynomial Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228929)