Fast multiplication of long numbers using FFT

DOI10.1007/BF02366498zbMATH Open0875.65047MaRDI QIDQ1364048FDOQ1364048

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 algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Sch%EF%BF%BD%EF%BF%BDnhage-Strassen+algorithm&go=Go Sch��nhage-Strassen algorithm]fast multiplication of long numbers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

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)