Author:
Perhun Valerii,Rashich Andrey,Nguyen Tan Ngoc
Publisher
Springer International Publishing
Reference15 articles.
1. T. Steinke, R. Sainuddin, A rigorous extension of the Schönhage–Strassen integer multiplication algorithm using complex interval arithmetic, in Computability and Complexity in Analysis, ed. by X. Zheng, N. Zhong. (CCA 2010), EPTCS 24 (2010), pp. 151–159
2. K. Millar, M. Lukowiak, S. Radziszowski, Design of a flexible Schönhage–Strassen FFT polynomial multiplier with high-level synthesis to accelerate HE in the cloud, in 2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig), (Cancun, Mexico, 2019), pp. 1–5
3. M. Bodrato, Toward optimal Toom-Cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0, in WAIFI, ed. by C. Carlet, B. Sunar, LNCS 4547 (Springer, Heidelberg, 2007), pp. 116–133
4. J. Ding, S. Li, Z. Gu, High-speed ECC processor over NIST prime fields applied with toom-cook multiplication. IEEE Trans. Circuits Syst. I Regul. Pap. 66(3), 1003–1016 (2019)
5. S. Vladimirov, Matematicheskie Osnovy Teorii Pomekhoustojchivogo Kodirovaniya (The Bonch-Bruevich Saint-Petersburg State University of Telecommunications, Saint-Petersburg, Russia, 2016)