More on squaring and multiplying large integers

DOI10.1109/12.295852zbMath1066.68507OpenAlexW2157949357MaRDI QIDQ4419744

Dan Zuras

Publication date: 1994

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

Full work available at URL: https://semanticscholar.org/paper/9f728688b677a16f6a65dba0589ee2ed27e9d191

zbMATH Keywords

FFT multiply

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (5)

On computational efficiency for multi-precision zero-finding methods ⋮ An algorithm for multiple-precision floating-point multiplication ⋮ A low-complexity LUT-based squaring algorithm ⋮ Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications

This page was built for publication: More on squaring and multiplying large integers