Fast multiplication of long numbers using FFT

DOI10.1007/BF02366498MaRDI QIDQ1364048zbMATH OpenFDO

Authors V. K. Zadiraka, S. S. Mel'nikova

Publication date 27 October 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02366498

zbMATH Keywords

complexitycryptographic algorithmsfast Fourier transformfast multiplication of long numbersSchönhage-Strassen algorithm

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Complexity and performance of numerical algorithms (65Y20) Cryptography (94A60)

Cited in

(1)

• Some approaches to the analysis of computation optimization problems

This page was built for publication: Fast multiplication of long numbers using FFT

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