Schnelle Multiplikation großer Zahlen

Schönhage, A., Strassen, V.·1971·Computing
DOI 10.1007/bf02242355

Cited by (1,000)

Items 401–500 of 1,000

  1. Integer matrix rank certification
    Arne Storjohann · 2009 · International Symposium on Symbolic and Algebraic Computation
  2. Two-Factor Authentication for the Bitcoin Protocol
    Christopher Mann, Daniel Loebenberger · 2015 · Lecture notes in computer science
  3. Fast integer multiplication using generalized Fermat primes
    Svyatoslav Covanov, Emmanuel Thomé · 2018 · Mathematics of Computation
  4. Power Series Composition and Change of Basis
    Alin Bostan, Bruno Salvy, Éric Schost · 2008
  5. Fast Computation of the Biquadratic Residue Symbol
    André Weilert · 2002 · Journal of Number Theory
  6. Storage modification machines
    Arnold Schönhage · 1979 · Lecture notes in computer science
  7. Low Complexity Algorithms for Linear Recurrences
    Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau · 2006
  8. Optimal size integer division circuits
    John H. Reif · 1989 · ACM Symposium on Theory of Computing (STOC)
  9. An efficient general purpose parallel computer
    Zvi Galil, Wolfgang J. Paul · 1981 · ACM Symposium on Theory of Computing (STOC)
  10. Efficient parallel circuits and algorithms for division
    Narayan Shankar, Vijaya Ramachandran · 1988 · Information Processing Letters
  11. Parallel computation over hyperbolic groups
    Jin‐Yi Cai · 1992 · ACM Symposium on Theory of Computing (STOC)
  12. A Fast Algorithm for Computing the P-curvature
    Alin Bostan, Xavier Caruso, Éric Schost · 2015 · International Symposium on Symbolic and Algebraic Computation
  13. On taking square roots without quadratic nonresidues over finite fields
    Tsz-Wo Sze · 2011 · Mathematics of Computation
  14. Low complexity algorithms for linear recurrences
    Alin Bostan, F. Chyzak, Bruno Salvy, Thomas Cluzeau · 2006 · International Symposium on Symbolic and Algebraic Computation
  15. Fast Polynomial Multiplication over F260
    David Harvey, Joris van der Hoeven, Grégoire Lecerf · 2016 · International Symposium on Symbolic and Algebraic Computation
  16. On the Fast Computation of the Weight Enumerator Polynomial and the $t$ Value of Digital Nets over Finite Abelian Groups
    Josef Dick, Makoto Matsumoto · 2013 · SIAM Journal on Discrete Mathematics
  17. Design of a Flexible Schönhage-Strassen FFT Polynomial Multiplier with High- Level Synthesis to Accelerate HE in the Cloud
    Kevin Millar, Marcin Łukowiak, Stanisław Radziszowski · 2019 · International Conference on ReConFigurable Computing and FPGAs (ReConFig)
  18. Low-Latency ASIC Algorithms of Modular Squaring of Large Integers for VDF Evaluation
    Ahmet Can Mert, Erdinç Öztürk, Erkay Savaş · 2020 · IEEE Transactions on Computers
  19. Iterative Toom-Cook methods for very unbalanced long integer multiplication
    Alberto Zanoni · 2010 · International Symposium on Symbolic and Algebraic Computation
  20. Multiplication is the easiest nontrivial arithmetic function
    Helmut Alt · 1985 · Theoretical Computer Science
  21. Implementation of multiple-precision parallel division and square root on distributed-memory parallel computers
    Daisuke Takahashi · 2002 · International Conference on Parallel Processing Workshops (ICPPW)
  22. Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
    Adolfo R. Escobedo, Erick Moreno‐Centeno · 2015 · INFORMS journal on computing
  23. On the complexity of integer matrix multiplication
    David Harvey, Joris van der Hoeven · 2017 · Journal of Symbolic Computation
  24. On Polynomial Multiplication in Chebyshev Basis
    Pascal Giorgi A · 2010
  25. Accelerating Pollard’s Rho Algorithm on Finite Fields
    Jung Hee Cheon, Jin Hong, Minkyu Kim · 2010 · Journal of Cryptology
  26. Fast Modular Algorithms for Squarefree Factorization and Hermite Integration
    Jürgen Gerhard · 2001 · Applicable Algebra in Engineering Communication and Computing
  27. Lossless Compression of Binary Trees With Correlated Vertex Names
    Abram Magner, Krzysztof Turowski, Wojciech Szpankowski · 2018 · IEEE Transactions on Information Theory
  28. Improved time and space bounds for Boolean matrix multiplication
    Leonard M. Adleman, Kellogg S. Booth, F. P. Preparata, Walter L. Ruzzo · 1978 · Acta Informatica
  29. Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
    J. Pintz, William Steiger, Endre Szemerédi · 1989 · Mathematics of Computation
  30. Fast Multiple-Precision Evaluation of Elementary Functions
    Richard P. Brent · 1997 · Springer eBooks
  31. Computational complexity of an optical model of computation
    Damien Woods · 2005
  32. FlexKA: A Flexible Karatsuba Multiplier Hardware Architecture for Variable-Sized Large Integers
    Byeongmin Kang, Hyungmin Cho · 2023 · IEEE Access
  33. Integer Programming, Lattices, and Results in Fixed Dimension
    Karen Aardal, Friedrich Eisenbrand · 2005 · Handbooks in operations research and management science
  34. How Fast Can We Multiply Large Integers on an Actual Computer?
    Martin Fürer · 2014 · Lecture notes in computer science
  35. Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
    Joris van der Hoeven, Robin Larrieu · 2018 · International Symposium on Symbolic and Algebraic Computation
  36. Derivation and Analysis of Fast Bilinear Algorithms for Convolution
    Caleb Ju, Edgar Solomonik · 2020 · SIAM Review
  37. Factoring Polynomials over Local Fields II
    Sebastian Pauli · 2010 · Lecture notes in computer science
  38. On the Distribution of Atkin and Elkies Primes
    Igor E. Shparlinski, Andrew V. Sutherland · 2014 · Foundations of Computational Mathematics
  39. Long Integers and Polynomial Evaluation with Estrin's Scheme
    Marco Bodrato, Alberto Zanoni · 2011 · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  40. Relaxed mltiplication using the middle product
    Joris van der Hoeven · 2003 · International Symposium on Symbolic and Algebraic Computation
  41. Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers
    Tsz-Wo Sze · 2012 · Symbolic Numeric Computation
  42. Exact output rate of Peresʼs algorithm for random number generation
    Sung-il Pae · 2013 · Information Processing Letters
  43. Computing rank-width exactly
    Sang‐il Oum · 2009 · Information Processing Letters
  44. Solving toeplitz- and vandermonde-like linear systems with large displacement rank
    Alin Bostan, Claude-Pierre Jeannerod, Éric Schost · 2007 · International Symposium on Symbolic and Algebraic Computation
  45. Computing -series of geometrically hyperelliptic curves of genus three
    David Harvey, Maike Massierer, Andrew V. Sutherland · 2016 · LMS Journal of Computation and Mathematics
  46. Algorithm for Gaussian Integer Exponentiation
    Aleksey Koval · 2016 · Advances in intelligent systems and computing
  47. Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work
    Christopher Lourenco, Adolfo R. Escobedo, Erick Moreno‐Centeno, Timothy A. Davis · 2019 · SIAM Journal on Matrix Analysis and Applications
  48. Randomized Algorithms
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  49. On the Complexity of Reliable Root Approximation
    Michael Kerber · 2009 · Lecture notes in computer science
  50. On the Complexity of the Montes Ideal Factorization Algorithm
    David James Ford, Olga Erzsébet Veres · 2010 · Lecture notes in computer science
  51. Fast online multiplication of real numbers
    Matthias Schröder · 1997 · Lecture notes in computer science
  52. An exact algorithm for subgraph homeomorphism
    Andrzej Lingas, Martin Wahlén · 2008 · Journal of Discrete Algorithms
  53. Computing the torsion points of a variety defined by lacunary polynomials
    Louis Leroux · 2011 · Mathematics of Computation
  54. Computing special powers in finite fields
    Joachim von zur Gathen, Michael Nöcker · 2003 · Mathematics of Computation
  55. Multiplication, division, and shift instructions in parallel random access machines
    Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran · 1992 · Theoretical Computer Science
  56. Time-and space-efficient evaluation of some hypergeometric constants
    Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima · 2007 · International Symposium on Symbolic and Algebraic Computation
  57. Dynamic programming bi-criteria combinatorial optimization
    Michal A. Mankowski, Mikhail Moshkov · 2020 · Discrete Applied Mathematics
  58. Phragmén’s voting methods and justified representation
    Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner · 2023 · Mathematical Programming
  59. Space-Efficient and Noise-Robust Quantum Factoring
    Seyoon Ragavan, Vinod Vaikuntanathan · 2024 · Lecture notes in computer science
  60. Sub-cubic cost algorithms for the all pairs shortest path problem
    Tadao Takaoka · 1995 · Lecture notes in computer science
  61. Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
    Preda Mihăilescu, François Morain, Éric Schost · 2007 · International Symposium on Symbolic and Algebraic Computation
  62. On the complexities of multipoint evaluation and interpolation
    Alin Bostan, Éric Schost · 2004 · Theoretical Computer Science
  63. Carry-Less to BIKE Faster
    Ming-Shing Chen, Tim E. Güneysu, Markus Krausz, Jan Philipp Thoma · 2022 · Lecture notes in computer science
  64. On the complexity of skew arithmetic
    Joris van der Hoeven · 2015 · Applicable Algebra in Engineering Communication and Computing
  65. Speeding up the Division and Square Root of Power Series
    Guillaume Hanrot, Michel Quercia, Paul Zimmermann · 2000 · OpenGrey (Institut de l'Information Scientifique et Technique)
  66. Extracting approximate patterns
    Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre · 2004 · Journal of Discrete Algorithms
  67. Relaxed Hensel lifting of triangular sets
    Romain Lebreton · 2014 · Journal of Symbolic Computation
  68. Efficient exact computation of iterated maps
    Jens Blanck · 2005 · The Journal of Logic and Algebraic Programming
  69. On Polynomial Multiplication in Chebyshev Basis
    Pascal Giorgi A · 2011 · IEEE Transactions on Computers
  70. Complexity Issues for Public Key Cryptography
    Ian F. Blake, Paul C. van Oorschot, Scott A. Vanstone · 1988 · Springer eBooks
  71. Some New Algorithms for High-Precision Computation of Euler's Constant
    Richard P. Brent, Edwin M. McMillan · 1980 · Mathematics of Computation
  72. Power series composition and change of basis
    Alin Bostan, Bruno Salvy, Éric Schost · 2008 · International Symposium on Symbolic and Algebraic Computation
  73. The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds
    Andreas-Stephan Elsenhans, Jörg Jahnel · 2006 · Lecture notes in computer science
  74. Fast Multiple-Precision Evaluation of Elementary Functions
    Richard P. Brent · 2000 · Springer eBooks
  75. Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography
    Selçuk Baktır · 2008 · Digital WPI
  76. Computational Complexity
    Stephan Mertens · 2006 · Wiley eBooks
  77. Integer Modular Multiplication With Barrett Reduction and Its Variants for Homomorphic Encryption Applications: A Comprehensive Review and an Empirical Study
    Ardianto Satriawan, Rella Mareta, Hanho Lee · 2024 · IEEE Access
  78. Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic
    Mariya Georgieva Belorgey, Sergiu Carpov, Nicolas Gama, Sandra Guasch, Dimitar Jetchev · 2024 · Lecture notes in computer science
  79. Quasi-optimal Multiplication of Linear Differential Operators
    Alexandre Benoit, Alin Bostan, Joris van der Hoeven · 2012 · Annual Symposium on Foundations of Computer Science
  80. Faster integer multiplication using plain vanilla FFT primes
    David Harvey, Joris van der Hoeven · 2017 · Mathematics of Computation
  81. A database of elliptic curves over ℚ( √5): a first report
    Jonathan Bober, Alyson Deines, Ariah Klages-Mundt, Benjamin LeVeque, Andrew Ohana, Ashwath Rabindranath, Paul Sharaba, William A. Stein · 2013 · The Open Book Series
  82. Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
    Shahram Jahani, Azman Samsudin, Kumbakonam Govindarajan Subramanian · 2014 · Journal of Applied Mathematics
  83. Parameterized and Exact Algorithms for Class Domination Coloring
    R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale · 2017 · Lecture notes in computer science
  84. Faster Number Theoretic Transform on Graphics Processors for Ring Learning with Errors Based Cryptography
    Ahmad Al Badawi, Bharadwaj Veeravalli, Khin Mi Mi Aung · 2018 · IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)
  85. An Efficient Method of Parallel Multiplication on a Single DSP Slice for Embedded FPGAs
    Zhangqin Huang, Shuo Zhang, Weidong Wang · 2019 · IEEE Access
  86. Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
    Joris van der Hoeven, Robin Larrieu · 2019 · Applicable Algebra in Engineering Communication and Computing
  87. Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
    Dimitris Bertsimas, Bradley Sturt · 2020 · Operations Research
  88. Fast and Error-Free Negacyclic Integer Convolution Using Extended Fourier Transform
    Jakub Klemsa · 2021 · Lecture notes in computer science
  89. Fast arithmetic with general Gauß periods
    Joachim von zur Gathen, Michael Nöcker · 2004 · Theoretical Computer Science
  90. Primality Test Via Quantum Factorization
    H. F. Chau, Hoi‐Kwong Lo · 1997 · International Journal of Modern Physics C
  91. Parallel Integer Polynomial Multiplication
    Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie · 2016 · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  92. Calculation of Fourier-Galois transforms in reduced binary number systems
    Чернов Владимир Михайлович · 2018 · Computer Optics
  93. Extracting Approximate Patterns
    Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre · 2003 · Lecture notes in computer science
  94. Fast Reduction of Ternary Quadratic Forms
    Friedrich Eisenbrand, Günter Rote · 2001 · Lecture notes in computer science
  95. CoMoM: Efficient Class-Oriented Evaluation of Multiclass Performance Models
    Giuliano Casale · 2008 · IEEE Transactions on Software Engineering
  96. Comparing the combinational complexities of arithmetic functions
    Helmut Alt · 1988 · Journal of the ACM
  97. Computational Complexity
    Stephan Mertens · 2016 · Wiley eBooks
  98. Implementation and performance evaluation of privacy-preserving fair reconciliation protocols on ordered sets
    Daniel A. Mayer, Dominik Teubert, Susanne Wetzel, Ulrike Meyer · 2011 · ACM Conference on Data and Application Security and Privacy (CODASPY)
  99. On the complexity of regular-grammars with integer attributes
    Marco Manna, Francesco Scarcello, Nicola Leone · 2010 · Journal of Computer and System Sciences
  100. Simultaneous Conversions with the Residue Number System Using Linear Algebra
    Javad Doliskani, Pascal Giorgi A, Romain Lebreton, Éric Schost · 2018 · ACM Transactions on Mathematical Software