Evaluation of Large Integer Multiplication Methods on Hardware

DOI10.1109/TC.2017.2677426MaRDI QIDQ4589512zbMATH OpenFDO

Authors Ciara Rafferty, Máire O'Neill, Neil Hanley

Publication date 10 November 2017

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

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(4)

• Implementation of the DKSS algorithm for multiplication of large numbers
• HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES
• scientific article; zbMATH DE number 5017575 (Why is no real title available?)
• A comparison of unified multiplier designs for the \textsc{Falcon} post-quantum digital signature. A case study of baseline, Tiling, Comba and Karatsuba approaches for FPGA and ASIC

This page was built for publication: Evaluation of Large Integer Multiplication Methods on Hardware

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