Schnelle Multiplikation großer Zahlen

The Art of Computer Programming

Knuth, D. E. (1968) · Cited by 16,097 · see citing works

An algorithm for the machine calculation of complex Fourier series

Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154 · see citing works

On the Minimum Computation Time of Functions

Cook, S. A., & Aanderaa, S. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0249212-8 · Cited by 315 · see citing works

Multiplikation großer Zahlen

Schönhage, A. (1966) · Computing · doi:10.1007/bf02234362 · Cited by 24 · see citing works

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830 · see citing works

Quantum networks for elementary arithmetic operations

Vedral, V., Barenco, A., & EKERT, A. K. (1996) · Physical Review A · doi:10.1103/physreva.54.147 · Cited by 799 · see citing works

The NP-completeness column: An ongoing guide

Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 799 · see citing works

Self-testing/correcting with applications to numerical problems

Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712 · see citing works

Riemann's hypothesis and tests for primality

Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709 · see citing works

Parallel Algorithms for Shared-Memory Machines

Karp, R. M., & Ramachandran, V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50022-9 · Cited by 682 · see citing works

Quantifier elimination for real closed fields by cylindrical algebraic decompostion

Collins, G. E. (1975) · Lecture notes in computer science · doi:10.1007/3-540-07407-4_17 · Cited by 622 · see citing works

Theorems on factorization and primality testing

Pollard, J. M. (1974) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100049252 · Cited by 398 · see citing works

Set Partitioning via Inclusion-Exclusion

Björklund, A., Husfeldt, T., & Koivisto, M. (2009) · SIAM Journal on Computing · doi:10.1137/070683933 · Cited by 365 · see citing works

On fast multiplication of polynomials over arbitrary algebras

Cantor, D. G., & Kaltofen, E. (1991) · Acta Informatica · doi:10.1007/bf01178683 · Cited by 365 · see citing works

Fast Multiple-Precision Evaluation of Elementary Functions

Brent, R. P. (1976) · Journal of the ACM · doi:10.1145/321941.321944 · Cited by 356 · see citing works

The Nature of Computation

Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 342 · see citing works

Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem

Bos, J. W., Costello, C., Naehrig, M., & Stebila, D. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.40 · Cited by 340 · see citing works

Solving a Polynomial Equation: Some History and Recent Progress

Pan, V. Y. (1997) · SIAM Review · doi:10.1137/s0036144595288554 · Cited by 336 · see citing works

Faster Fully Homomorphic Encryption

Stehlé, D., & Steinfeld, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_22 · Cited by 327 · see citing works

Modern Computer Arithmetic

Brent, R. P., & Zimmermann, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921698 · Cited by 323 · see citing works

All pairs shortest paths using bridging sets and rectangular matrix multiplication

Zwick, U. (2002) · Journal of the ACM · doi:10.1145/567112.567114 · Cited by 315 · see citing works

Post-Quantum Lattice-Based Cryptography Implementations

Nejatollahi, H., Dutt, N. D., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R. (2019) · ACM Computing Surveys · doi:10.1145/3292548 · Cited by 303 · see citing works

Private predictive analysis on encrypted medical data

Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · see citing works

Fourier meets möbius: fast subset convolution

Björklund, A., Husfeldt, T., Kaski, P., & Koivisto, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250801 · Cited by 273 · see citing works

Feedback shift registers, 2-adic span, and combiners with memory

Klapper, A., & Goresky, M. (1997) · Journal of Cryptology · doi:10.1007/s001459900024 · Cited by 261 · see citing works

A Gröbner Free Alternative for Polynomial System Solving

Giusti, M., Lecerf, G., & Salvy, B. (2001) · Journal of Complexity · doi:10.1006/jcom.2000.0571 · Cited by 246 · see citing works

Faster integer multiplication

Fürer, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250800 · Cited by 246 · see citing works

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

Ben‐Sasson, E., Goldreich, O., Harsha, P., Sudan, M., & Vadhan, S. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539705446810 · Cited by 243 · see citing works

Fast parallel circuits for the quantum Fourier transform

Cleve, R., & Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 223 · see citing works

Chinese remaindering with errors

Goldreich, O., Ron, D., & Sudan, M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.850672 · Cited by 222 · see citing works

Faster Integer Multiplication

Fürer, M. (2009) · SIAM Journal on Computing · doi:10.1137/070711761 · Cited by 217 · see citing works

A Fortran Multiple-Precision Arithmetic Package

Brent, R. P. (1978) · ACM Transactions on Mathematical Software · doi:10.1145/355769.355775 · Cited by 216 · see citing works

Quantum arithmetic with the quantum Fourier transform

Ruiz, L., & García-Escartín, J. C. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1603-1 · Cited by 206 · see citing works

The Area-Time Complexity of Binary Multiplication

Brent, R. P., & Kung, H. T. (1981) · Journal of the ACM · doi:10.1145/322261.322269 · Cited by 196 · see citing works

Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2

Sch�nhage, A. (1977) · Acta Informatica · doi:10.1007/bf00289470 · Cited by 192 · see citing works

Riemann's Hypothesis and tests for primality

Miller, G. L. (1975) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800116.803773 · Cited by 190 · see citing works

Exact and Approximate Distances in Graphs — A Survey

Zwick, U. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44676-1_3 · Cited by 176 · see citing works

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

Pan, V. Y. (2002) · Journal of Symbolic Computation · doi:10.1006/jsco.2002.0531 · Cited by 175 · see citing works

A Rigorous Subexponential Algorithm For Computation of Class Groups

Hafner, J. L., & McCurley, K. S. (1989) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1989-1002631-0 · Cited by 175 · see citing works

An overview of computational complexity

Cook, S. A. (1983) · Communications of the ACM · doi:10.1145/358141.358144 · Cited by 174 · see citing works

Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware

Pöppelmann, T., & Güneysu, T. E. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33481-8_8 · Cited by 169 · see citing works

Computing Frobenius maps and factoring polynomials

Gathen, J. V. Z., & Shoup, V. (1992) · Computational Complexity · doi:10.1007/bf01272074 · Cited by 169 · see citing works

Computational strategies for the Riemann zeta function

Borwein, J. M., Bradley, D. M., & Crandall, R. E. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00336-8 · Cited by 169 · see citing works

Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition

Collins, G. E. (1998) · Texts & monographs in symbolic computation/Texts and monographs in symbolic computation · doi:10.1007/978-3-7091-9459-1_4 · Cited by 165 · see citing works

Floating-Point LLL Revisited

Nguên, P. Q., & Stehlé, D. (2005) · Lecture notes in computer science · doi:10.1007/11426639_13 · Cited by 161 · see citing works

A Survey on Fully Homomorphic Encryption

Martins, P., Sousa, L. A., & Mariano, A. (2017) · ACM Computing Surveys · doi:10.1145/3124441 · Cited by 158 · see citing works

Basics of quantum computation

Vedral, V., & Plenio, M. B. (1998) · Progress in Quantum Electronics · doi:10.1016/s0079-6727(98)00004-4 · Cited by 154 · see citing works

MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION

Brent, R. P. (1976) · Elsevier eBooks · doi:10.1016/b978-0-12-697560-4.50014-9 · Cited by 154 · see citing works

Variants of the Selberg sieve, and bounded intervals containing many primes

Polymath, D. (2014) · Research in the Mathematical Sciences · doi:10.1186/s40687-014-0012-7 · Cited by 153 · see citing works

Private collaborative forecasting and benchmarking

Atallah, M. J., Bykova, M., Li, J., Frikken, K. B., & Topkara, M. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029204 · Cited by 153 · see citing works

cuHE: A Homomorphic Encryption Accelerator Library

Dai, W., & Sunar, B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29172-7_11 · Cited by 149 · see citing works

Fast linear algebra is stable

Demmel, J., Dumitriu, I., & Holtz, O. (2007) · Numerische Mathematik · doi:10.1007/s00211-007-0114-x · Cited by 148 · see citing works

High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers

Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_19 · Cited by 147 · see citing works

Approximations and complex multiplication according to Ramanujan

Chudnovsky, D. V., & Chudnovsky, G. V. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3240-5_63 · Cited by 146 · see citing works

Why Philosophers Should Care about Computational Complexity

Aaronson, S. (2013) · The MIT Press eBooks · doi:10.7551/mitpress/8009.003.0011 · Cited by 143 · see citing works

Fast linear algebra is stable

Demmel, J. W., Dumitriu, I., & Holtz, O. (2006) · Cited by 143 · see citing works

Algorithms and Complexity

Grechuk, B. (2021) · Springer eBooks · doi:10.1007/978-3-030-80627-9_7 · Cited by 137 · see citing works

Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi

Borwein, J. M., Borwein, P., & Bailey, D. H. (1989) · American Mathematical Monthly · doi:10.1080/00029890.1989.11972169 · Cited by 133 · see citing works

Improved sparse multivariate polynomial interpolation algorithms

Kaltofen, E., & Yagati, L. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51084-2_44 · Cited by 130 · see citing works

Exploring the Feasibility of Fully Homomorphic Encryption

Wang, W., Hu, Y., Chen, L., Huang, X., & Sunar, B. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2013.154 · Cited by 129 · see citing works

Optimal and nearly optimal algorithms for approximating polynomial zeros

Pan, V. Y. (1996) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(96)00080-6 · Cited by 128 · see citing works

Accelerating fully homomorphic encryption using GPU

Wang, W., Hu, Y., Chen, L., Huang, X., & Sunar, B. (2012) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2012.6408660 · Cited by 125 · see citing works

Algorithms for propositional model counting

Samer, M., & Szeider, S. (2009) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2009.06.002 · Cited by 121 · see citing works

Algebraic Shift Register Sequences

Goresky, M., & Klapper, A. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139057448 · Cited by 121 · see citing works

Universal hashing and k-wise independent random variables via integer arithmetic without primes

Dietzfelbinger, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60922-9_46 · Cited by 118 · see citing works

The chip complexity of binary arithmetic

Brent, R. P., & Kung, H. T. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804666 · Cited by 115 · see citing works

Batch Binary Edwards

Bernstein, D. J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_19 · Cited by 114 · see citing works

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

Khedr, A. F., Gulak, P. G., & Vaikuntanathan, V. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2500576 · Cited by 111 · see citing works

Relax, but Don’t be Too Lazy

van der Hoeven, J. (2002) · Journal of Symbolic Computation · doi:10.1006/jsco.2002.0562 · Cited by 111 · see citing works

Factoring multivariate polynomials via partial differential equations

Gao, S. (2002) · Mathematics of Computation · doi:10.1090/s0025-5718-02-01428-x · Cited by 109 · see citing works

Post-quantum RSA

Bernstein, D. J., Heninger, N., Lou, P., & Valenta, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_18 · Cited by 103 · see citing works

Computing Hilbert class polynomials with the Chinese remainder theorem

Sutherland, A. V. (2010) · Mathematics of Computation · doi:10.1090/s0025-5718-2010-02373-7 · Cited by 103 · see citing works

A hybrid model using fuzzy logic and an extreme learning machine with vector particle swarm optimization for wireless sensor network localization

Phoemphon, S., So–In, C., & Niyato, D. T. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.01.004 · Cited by 102 · see citing works

Polynomial evaluation and interpolation on special sets of points

Bostan, A., & Schost, É. (2005) · Journal of Complexity · doi:10.1016/j.jco.2004.09.009 · Cited by 101 · see citing works

Computing Parametric Geometric Resolutions

Schost, É. (2003) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-002-0109-x · Cited by 101 · see citing works

The truncated fourier transform and applications

van der Hoeven, J. (2004) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1005285.1005327 · Cited by 100 · see citing works

Factoring Polynomials Over Finite Fields: A Survey

Gathen, J. V. Z., & Panario, D. (2001) · Journal of Symbolic Computation · doi:10.1006/jsco.1999.1002 · Cited by 98 · see citing works

Efficient Authentication from Hard Learning Problems

Kiltz, E., Pietrzak, K., Cash, D., Jain, A., & Venturi, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_3 · Cited by 96 · see citing works

Computation of π Using Arithmetic-Geometric Mean

Salamin, E. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3240-5_46 · Cited by 95 · see citing works

Even faster integer multiplication

Harvey, D., van der Hoeven, J., & Lecerf, G. (2016) · Journal of Complexity · doi:10.1016/j.jco.2016.03.001 · Cited by 94 · see citing works

Fast generation of prime numbers and secure public-key cryptographic parameters

Maurer, U. M. (1995) · Journal of Cryptology · doi:10.1007/bf00202269 · Cited by 94 · see citing works

Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients

Schönhage, A. (1982) · Lecture notes in computer science · doi:10.1007/3-540-11607-9_1 · Cited by 93 · see citing works

Interpolation and Approximation

Trangenstein, J. A. (2017) · Texts in computational science and engineering · doi:10.1007/978-3-319-69110-7_1 · Cited by 92 · see citing works

Faster Kyber and Dilithium on the Cortex-M4

Abdulrahman, A., Hwang, V., Kannwischer, M. J., & Sprenkels, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09234-3_42 · Cited by 92 · see citing works

Accelerating Fully Homomorphic Encryption in Hardware

Doröz, Y., Öztürk, E., & Sunar, B. (2014) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2345388 · Cited by 92 · see citing works

Algebraic complexities and algebraic curves over finite fields

Chudnovsky, D. V., & Chudnovsky, G. V. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90012-x · Cited by 92 · see citing works

Modular polynomials via isogeny volcanoes

Bröker, R., Lauter, K., & Sutherland, A. V. (2011) · Mathematics of Computation · doi:10.1090/s0025-5718-2011-02508-1 · Cited by 92 · see citing works

Asymptotically fast computation of Hermite normal forms of integer matrices

Storjohann, A., & Labahn, G. (1996) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/236869.237083 · Cited by 91 · see citing works

Efficient checking of computations

Lipton, R. J. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52282-4_44 · Cited by 90 · see citing works

Sylvester–Habicht Sequences and Fast Cauchy Index Computation

Lickteig, T., & Roy, M.-F. (2001) · Journal of Symbolic Computation · doi:10.1006/jsco.2000.0427 · Cited by 90 · see citing works

Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

Bostan, A., Gaudry, P., & Schost, É. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539704443793 · Cited by 90 · see citing works

Algebraic Complexity Theory

Strassen, V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50016-3 · Cited by 88 · see citing works

Discrete Weighted Transforms and Large-Integer Arithmetic

Crandall, R. E., & Fagin, B. S. (1994) · Mathematics of Computation · doi:10.1090/s0025-5718-1994-1185244-1 · Cited by 87 · see citing works

All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms

Zwick, U. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743464 · Cited by 87 · see citing works

Low-dimensional lattice basis reduction revisited

Nguyễn, P. Q., & Stehlé, D. (2009) · ACM Transactions on Algorithms · doi:10.1145/1597036.1597050 · Cited by 85 · see citing works

Algorithms for Exponentiation in Finite Fields

Gao, S., Gathen, J. V. Z., Panario, D., & Shoup, V. (2000) · Journal of Symbolic Computation · doi:10.1006/jsco.1999.0309 · Cited by 85 · see citing works

Fast algorithms for computing isogenies between elliptic curves

Bostan, A., Morain, F., Salvy, B., & Schost, É. (2008) · Mathematics of Computation · doi:10.1090/s0025-5718-08-02066-8 · Cited by 84 · see citing works

50 Years of FFT Algorithms and Applications

Kumar, G. G., Sahoo, S. K., & Meher, P. K. (2019) · Circuits Systems and Signal Processing · doi:10.1007/s00034-019-01136-8 · Cited by 83 · see citing works

Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0

Bodrato, M. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73074-3_10 · Cited by 83 · see citing works

Robust pcps of proximity, shorter pcps and applications to coding

Ben‐Sasson, E., Goldreich, O., Harsha, P., Sudan, M., & Vadhan, S. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007361 · Cited by 83 · see citing works

The complexity of class polynomial computation via floating point approximations

Enge, A. (2008) · Mathematics of Computation · doi:10.1090/s0025-5718-08-02200-x · Cited by 82 · see citing works

The shifted number system for fast linear algebra on integer matrices

Storjohann, A. (2005) · Journal of Complexity · doi:10.1016/j.jco.2005.04.002 · Cited by 82 · see citing works

Multiplikation großer Zahlen

Schönhage, A. (1966) · Computing · doi:10.1007/bf02234362 · Cited by 24 · see citing works

Ein neues Multiplikationsverfahren für Dualzahlen

Weber, C. (1953) · ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik · doi:10.1002/zamm.19530331204

Schnelle Multiplikation

Dewdney, A. K. (1995) · Springer eBooks · doi:10.1007/978-3-642-78872-7_25 · Cited by 2 · see citing works

A novel multiplication algorithm based on Euclidean division for multiplying moderately huge numbers

Mir, S. A., Mir, S. A., & -Mohalla, Z. (2019) · doi:10.13140/rg.2.2.10904.24321

Computertechnik

Schiffmann, W. H., Schmitz, R., & Weiland, J. (2001) · Springer-Lehrbuch · doi:10.1007/978-3-662-10237-4_14