Fast multiplication of long numbers using FFT

DOI10.1007/BF02366498zbMath0875.65047MaRDI QIDQ1364048

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

Publication date: 27 October 1997

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

zbMATH Keywords

complexityfast Fourier transformcryptographic algorithmsSchönhage-Strassen algorithmfast multiplication of long numbers

Mathematics Subject Classification ID

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

Related Items (1)

Some approaches to the analysis of computation optimization problems

Cites Work

• Unnamed Item
• Unnamed Item

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