More on squaring and multiplying large integers

DOI10.1109/12.295852MaRDI QIDQ4419744zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2085209
• Fast multiplication of large numbers
• Even faster integer multiplication
• Large integer multiplication on hypercubes
• Efficient big integer multiplication and squaring algorithms for cryptographic applications

Cited in

(12)

• Large integer multiplication on hypercubes
• Efficient big integer multiplication and squaring algorithms for cryptographic applications
• An algorithm for multiple-precision floating-point multiplication
• Fast multiplication of large numbers
• Iterative Toom-Cook methods for very unbalanced long integer multiplication
• Even faster integer multiplication
• scientific article; zbMATH DE number 2085209 (Why is no real title available?)
• The combinatorics of product scanning multiplication and squaring
• A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
• Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
• On computational efficiency for multi-precision zero-finding methods
• A low-complexity LUT-based squaring algorithm

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

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