Schnelle Multiplikation großer Zahlen

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

Cited by (1,000)

Items 201–300 of 1,000

  1. Fast arithmetic for triangular sets: From theory to practice
    Xin Li, Marc Moreno Maza, Éric Schost · 2008 · Journal of Symbolic Computation
  2. Fast on-line integer multiplication
    Michael J. Fischer, Larry J. Stockmeyer · 1974 · Journal of Computer and System Sciences
  3. On the complexity of computing with planar algebraic curves
    Alexander Kobel, Michael Sagraloff · 2014 · Journal of Complexity
  4. Subquadratic Algorithm for Dynamic Shortest Distances
    Piotr Sankowski · 2005 · Lecture notes in computer science
  5. A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
    Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann · 2007 · International Symposium on Symbolic and Algebraic Computation
  6. Interactive proof systems and alternating time—space complexity
    Lance Fortnow, Carsten Lund · 1993 · Theoretical Computer Science
  7. Single-factor lifting and factorization of polynomials over local fields
    Jordi Guàrdia, Enric Nart, Sebastian Pauli · 2012 · Journal of Symbolic Computation
  8. Fast Algorithms for Linear Algebra Modulo N
    Arne Storjohann, Thom Mulders · 1998 · Lecture notes in computer science
  9. Newton’s method and FFT trading
    Joris van der Hoeven · 2010 · Journal of Symbolic Computation
  10. Faster integer multiplication using short lattice vectors
    David Harvey, Joris van der Hoeven · 2019 · The Open Book Series
  11. Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
    David Harvey, Joris van der Hoeven · 2019 · Journal of Complexity
  12. X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience
    Zhuqing Jia, Syed A. Jafar · 2022 · IEEE Transactions on Information Theory
  13. Large Period Nearly deBruijn FCSR Sequences
    Andrew Klapper, Mark Goresky · 1995 · Lecture notes in computer science
  14. Modular exponentiation via the explicit Chinese remainder theorem
    Daniel J. Bernstein, Jonathan Sorenson · 2006 · Mathematics of Computation
  15. Trans-dichotomous algorithms without multiplication — some upper and lower bounds
    Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro · 1997 · Lecture notes in computer science
  16. Optimality of the Fast Fourier transform
    Christos H. Papadimitriou · 1979 · Journal of the ACM
  17. Threshold Encryption with Silent Setup
    Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang · 2024 · Lecture notes in computer science
  18. Complexity estimates for two uncoupling algorithms
    Alin Bostan, Frédéric Chyzak, Élie de Panafieu · 2013 · International Symposium on Symbolic and Algebraic Computation
  19. Design and Implementation of a Low-Latency Modular Multiplication Algorithm
    Erdinç Öztürk · 2020 · IEEE Transactions on Circuits and Systems I Regular Papers
  20. Tests and Constructions of Irreducible Polynomials over Finite Fields
    Shuhong Gao, Daniel Panario · 1997 · Springer eBooks
  21. A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers
    Preparata · 1983 · IEEE Transactions on Computers
  22. Fast computation of power series solutions of systems of differential equations
    Alin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic · 2006 · arXiv (Cornell University)
  23. High Performance Quantum Modular Multipliers
    Rich Rines, Isaac L. Chuang · 2018 · arXiv (Cornell University)
  24. Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
    Jin-Guo Liu, Xun Gao, Madelyn Cain, Mikhail D. Lukin, Sheng-Tao Wang · 2023 · SIAM Journal on Scientific Computing
  25. Accelerating the CM method
    Andrew V. Sutherland · 2012 · LMS Journal of Computation and Mathematics
  26. Area-time optimal vlsi integer multiplier with minimum computation time
    Kurt Mehlhorn, Franco P. Preparata · 1983 · Lecture notes in computer science
  27. Exponentiation in finite fields: Theory and practice
    Joachim von zur Gathen, Michael Nöcker · 1997 · Lecture notes in computer science
  28. The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
    Lamagna · 1979 · IEEE Transactions on Computers
  29. Logarithmic depth circuits for algebraic functions
    John H. Reif · 1983 · Annual Symposium on Foundations of Computer Science
  30. Learning Poisson Binomial Distributions
    Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio · 2015 · Algorithmica
  31. Computing Frobenius maps and factoring polynomials
    Joachim von zur Gathen, Victor Shoup · 1992 · ACM Symposium on Theory of Computing (STOC)
  32. Identifying supersingular elliptic curves
    Andrew V. Sutherland · 2012 · LMS Journal of Computation and Mathematics
  33. An in-place truncated fourier transform and applications to polynomial multiplication
    David Harvey, Daniel S. Roche · 2010 · International Symposium on Symbolic and Algebraic Computation
  34. Notes on the Truncated Fourier Transform
    Joris van der Hoeven · 2012
  35. Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform
    F. P. Preparata, Jean E. Vuillemin · 1981 · Lecture notes in computer science
  36. Acceleration of Euclidean algorithm and extensions
    Victor Ya. Pan, Xinmao Wang · 2002 · International Symposium on Symbolic and Algebraic Computation
  37. Hyperbolic Julia Sets are Poly-Time Computable
    Mark Braverman · 2005 · Electronic Notes in Theoretical Computer Science
  38. On the evaluation of modular polynomials
    Andrew V. Sutherland · 2013 · The Open Book Series
  39. Efficient accelero-summation of holonomic functions
    Joris van der Hoeven · 2007 · Journal of Symbolic Computation
  40. Polynomial root finding over local rings and application to error correcting codes
    Jérémy Berthomieu, Grégoire Lecerf, Guillaume Quintin · 2013 · Applicable Algebra in Engineering Communication and Computing
  41. High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers
    Zhe Liu, Thomas Pöppelmann, Tobias Oder, Hwajeong Seo, Sujoy Sinha Roy, Tim E. Güneysu, Johann Großschädl, Howon Kim, Ingrid M.R. Verbauwhede · 2017 · ACM Transactions on Embedded Computing Systems
  42. Fast arithmetic for triangular sets
    Xin Li, Marc Moreno Maza, Éric Schost · 2007 · International Symposium on Symbolic and Algebraic Computation
  43. A Novel and Efficient Design for an RSA Cryptosystem With a Very Large Key Size
    Xinming Huang, Wei Wang · 2015 · IEEE Transactions on Circuits & Systems II Express Briefs
  44. FNT-Based Reed-Solomon Erasure Codes
    Alexandre Soro, Jérôme Lacan · 2010 · IEEE Consumer Communications and Networking Conference
  45. The twenty-fourth Fermat number is composite
    Richard E. Crandall, Ernst W. Mayer, Jason S. Papadopoulos · 2002 · Mathematics of Computation
  46. Partitioned convolution algorithms for real-time auralization
    Frank Wefers · 2014 · RWTH Publications (RWTH Aachen)
  47. NTTU: An Area-Efficient Low-Power NTT-Uncoupled Architecture for NTT-Based Multiplication
    Neng Zhang, Qiao Qin, Hang Yuan, Chenggao Zhou, Shouyi Yin, Shaojun Wei, Leibo Liu · 2020 · IEEE Transactions on Computers
  48. Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
    Christophe Négre, Thomas Plantard · 2008 · Lecture notes in computer science
  49. Hard instance generation for SAT
    Satoshi Horie, Osamu Watanabe · 1997 · Lecture notes in computer science
  50. CSAR : A Practical and Probable Technique to Make Randomized Systems Accountable
    Michael Backes A, Peter Druschel, Andreas Haeberlen, Dominique Unruh · 2009 · Max Planck Digital Library
  51. Accurate and efficient evaluation of Schur and Jack functions
    James Weldon Demmel, Plamen Koev · 2005 · Mathematics of Computation
  52. Hensel lifting and bivariate polynomial factorisation over finite fields
    Shuhong Gao, Alan G. B. Lauder · 2001 · Mathematics of Computation
  53. Fragile watermarking using finite field trigonometrical transforms
    Renato J. Cintra, Vassil S. Dimitrov, H. M. de Oliveira, Ricardo M. Campello de Souza · 2009 · Signal Processing Image Communication
  54. Factoring Polynomials Over Local Fields
    Sebastian Pauli · 2001 · Journal of Symbolic Computation
  55. Inversion of circulant matrices over 𝐙ₘ
    Dario A. Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara · 2000 · Mathematics of Computation
  56. Accelerating number theoretic transform in GPU platform for fully homomorphic encryption
    Jia-Zheng Goey, Wai‐Kong Lee, Bok‐Min Goi, Wun‐She Yap · 2020 · The Journal of Supercomputing
  57. Integer Programming and Algorithmic Geometry of Numbers
    Friedrich Eisenbrand · 2009 · Springer eBooks
  58. Homology flows, cohomology cuts
    Erin Wolf Chambers, Jeff Erickson, Amir Nayyeri · 2009 · ACM Symposium on Theory of Computing (STOC)
  59. Faster relaxed multiplication
    Joris van der Hoeven · 2014 · International Symposium on Symbolic and Algebraic Computation
  60. Complexity of OM factorizations of polynomials over local fields
    Jens-Dietrich Bauch, Enric Nart, Hayden D. Stainsby · 2013 · LMS Journal of Computation and Mathematics
  61. Improving the Efficiency of Homomorphic Encryption Schemes
    Yin Hu · 2013 · Digital WPI
  62. Space- and time-efficient polynomial multiplication
    Daniel S. Roche · 2009 · International Symposium on Symbolic and Algebraic Computation
  63. Some New Algorithms for High-Precision Computation of Euler’s Constant
    Richard P. Brent, Edwin M. McMillan · 2004 · Springer eBooks
  64. Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
    Xiao-Wen Chang, Damien Stehlé, Gilles Villard · 2012 · Mathematics of Computation
  65. Subpolynomial complexity classes of real functions and real numbers
    Norbert Müller · 1986 · Lecture notes in computer science
  66. Fast implementation of length-adaptive privacy amplification in quantum key distribution
    Chunmei Zhang, Mo Li, Jingzheng Huang, Hongwei Li, Fangyi Li, Chuan Wang, Zhen−Qiang Yin, Wei Ren Chen, Zhen-Fu Han, Patcharapong Treeviriyanupab et al. · 2014 · Chinese Physics B
  67. Complexity Estimates for Fourier-Motzkin Elimination
    Rui-Juan Jing, Marc Moreno Maza, Delaram Talaashrafi · 2020 · Lecture notes in computer science
  68. On the complexity of multivariate blockwise polynomial multiplication
    Joris van der Hoeven, Grégoire Lecerf · 2012 · International Symposium on Symbolic and Algebraic Computation
  69. A cache-friendly truncated FFT
    David Harvey · 2009 · Theoretical Computer Science
  70. Approximations and complex multiplication according to Ramanujan
    David V. Chudnovsky, Gregory V. Chudnovsky · 2004 · Springer eBooks
  71. Complexity of algorithms and computations
    Sergey Seraphimovich Marchenkov, В.Л. Матросов · 1981 · Journal of Mathematical Sciences
  72. What algorithms could not be
    Walter Dean · 2007 · Rutgers University Community Repository (Rutgers University)
  73. Homology Flows, Cohomology Cuts
    Erin Wolf Chambers, Jeff Erickson, Amir Nayyeri · 2012 · SIAM Journal on Computing
  74. Fast skew-feedback shift-register synthesis
    Vladimir R. Sidorenko, Martin Bossert · 2012 · Designs Codes and Cryptography
  75. Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
    Donald Donglong Chen, Gavin Xiaoxu Yao, Ray C. C. Cheung, Derek C.W. Pao, Çetin Kaya Koç · 2015 · IEEE Transactions on Computers
  76. A million-bit multiplier architecture for fully homomorphic encryption
    Yarkın Doröz, Erdinç Öztürk, Berk Sunar · 2014 · Microprocessors and Microsystems
  77. Algorithms for monitoring real-time properties
    David Basin, Felix Klaedtke, Eugen Zălinescu · 2017 · Acta Informatica
  78. Optimal routing in double loop networks
    Domingo Gómez‐Pérez, Jaime Gutiérrez, Álvar Ibeas · 2007 · Theoretical Computer Science
  79. Efficient Algorithms for Computing the Jacobi Symbol
    Shawna Meyer Eikenberry, Jonathan Sorenson · 1998 · Journal of Symbolic Computation
  80. Multiple-Precision Zero-Finding Methods and the Complexity of Elementary Function Evaluation
    Richard P. Brent · 1975 · Defense Technical Information Center (DTIC)
  81. Efficient Multiplication of Polynomials on Graphics Hardware
    Pavel Emeliyanenko · 2009 · Lecture notes in computer science
  82. On Effective Analytic Continuation
    Joris van der Hoeven · 2007 · Mathematics in Computer Science
  83. Practical Secure Function Evaluation
    Thomas H. Schneider · 2008 · Informatiktage
  84. Model Counting for CNF Formulas of Bounded Modular Treewidth
    Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider · 2015 · Algorithmica
  85. Irregular primes to 163 million
    Joe Buhler, David Harvey · 2011 · Mathematics of Computation
  86. Existence and efficient construction of fast Fourier transforms on supersolvable groups
    Ulrich Baum · 1991 · Computational Complexity
  87. Change of order for regular chains in positive dimension
    Xavier Dahan, Xin Jin, Marc Moreno Maza, Éric Schost · 2007 · Theoretical Computer Science
  88. Pipeline Architectures for Radix-2 New Mersenne Number Transform
    Omar Nibouche, Said Boussakta, M. Darnell · 2008 · IEEE Transactions on Circuits and Systems I Regular Papers
  89. Efficient Authentication from Hard Learning Problems
    Eike Kiltz, Krzysztof Pietrzak, Daniele Venturi, David Cash, Abhishek Jain · 2016 · Journal of Cryptology
  90. Fast computation of common left multiples of linear ordinary differential operators
    Alin Bostan, Frédéric Chyzak, Bruno Salvy, Ziming Li · 2012 · International Symposium on Symbolic and Algebraic Computation
  91. Accelerating an FHE Integer Multiplier Using Negative Wrapped Convolution and Ping-Pong FFT
    Xiang Peng Feng, Shuguo Li · 2018 · IEEE Transactions on Circuits & Systems II Express Briefs
  92. A multimodular algorithm for computing Bernoulli numbers
    David Harvey · 2010 · Mathematics of Computation
  93. Algorithms for Propositional Model Counting
    Marko Samer, Stefan Szeider · 2007 · Springer eBooks
  94. Fast Multivariate Power Series Multiplication in Characteristic Zero
    Grégoire Lecerf, Éric Schost · 2001 · SADIO Electronic Journal of Informatics and Operations Research
  95. Low-Complexity VLSI Design of Large Integer Multipliers for Fully Homomorphic Encryption
    Jheng-Hao Ye, Ming‐Der Shieh · 2018 · IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  96. Area-Efficient Multipliers Based on Multiple-Radix Representations
    Vassil S. Dimitrov, Kimmo U. Jarvinen, Jithra Adikari · 2010 · IEEE Transactions on Computers
  97. New algorithms for relaxed multiplication
    Joris van der Hoeven · 2007 · Journal of Symbolic Computation
  98. Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
    Sung-il Pae, Michael C. Loui · 2006 · IEEE Transactions on Information Theory
  99. Fast Multiplication in Binary Fields on GPUs via Register Cache
    Eli Ben‐Sasson, Matan Hamilis, Mark Silberstein, Eran Tromer · 2016 · International Conference on Supercomputing
  100. Open Problems in Number Theoretic Complexity
    Leonard M. Adleman, Kevin S. McCurley · 1987 · Elsevier eBooks