Schnelle Multiplikation großer Zahlen

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

Cited by (1,000)

Items 101–200 of 1,000

  1. On time versus space and related problems
    John E. Hopcroft, Wolfgang J. Paul, Leslie Gabriel Valiant · 1975 · Annual Symposium on Foundations of Computer Science
  2. Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
    Mikkel Thorup, Yin Zhang⋆ · 2012 · SIAM Journal on Computing
  3. Saving space by algebraization
    Daniel Lokshtanov, Jesper Nederlof · 2010 · ACM Symposium on Theory of Computing (STOC)
  4. Fast modular transforms via division
    Robert T. Moenck, Allan Borodin · 1972 · Annual Symposium on Switching & Automata Theory
  5. Fast arithmetic for public-key algorithms in Galois fields with composite exponents
    Christof Paar, Peter Fleischmann, Pedro Soria-Rodríguez · 1999 · IEEE Transactions on Computers
  6. Fast modular transforms
    Allan Borodin, Robert T. Moenck · 1974 · Journal of Computer and System Sciences
  7. The Middle Product Algorithm I
    Guillaume Hanrot, Michel Quercia, Paul Zimmermann · 2004 · Applicable Algebra in Engineering Communication and Computing
  8. Cryptanalysis Based on 2-Adic Rational Approximation
    Andrew Klapper, Mark Goresky · 1995 · Lecture notes in computer science
  9. Fast matrix multiplication is stable
    James Weldon Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg · 2007 · Numerische Mathematik
  10. Fast Integer Multiplication Using Modular Arithmetic
    Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi · 2008 · SIAM Journal on Computing
  11. Fast algorithms for Taylor shifts and certain difference equations
    Joachim von zur Gathen, Jürgen Gerhard · 1997 · International Symposium on Symbolic and Algebraic Computation
  12. Evaluation and comparison of two efficient probabilistic primality testing algorithms
    Louis M. Monier · 1980 · Theoretical Computer Science
  13. Factoring in Skew-polynomial Rings over Finite Fields
    Mark W. Giesbrecht · 1998 · Journal of Symbolic Computation
  14. Shifting Graphs and Their Applications
    Nicholas J. Pippenger, Leslie Gabriel Valiant · 1976 · Journal of the ACM
  15. Algebraic theory of finite fourier transforms
    Peter J. Nicholson · 1971 · Journal of Computer and System Sciences
  16. Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters
    David Eppstein, Michael T. Goodrich · 2010 · IEEE Transactions on Knowledge and Data Engineering
  17. An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
    Mikko Koivisto · 2006 · Annual Symposium on Foundations of Computer Science
  18. Conceptual Review on Number Theoretic Transform and Comprehensive Review on Its Implementations
    Ardianto Satriawan, Infall Syafalni, Rella Mareta, Isa Anshori, Wervyan Shalannanda, Aleams Barra · 2023 · IEEE Access
  19. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
    Jeffrey C. Lagarias · 1980 · Journal of Algorithms
  20. Accelerating NTRU based homomorphic encryption using GPUs
    Wei Dai, Yarkın Doröz, Berk Sunar · 2014 · IEEE High Performance Extreme Computing Conference
  21. Learning poisson binomial distributions
    Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio · 2012 · ACM Symposium on Theory of Computing (STOC)
  22. Functional decomposition of polynomials: The wild case
    Joachim von zur Gathen · 1990 · Journal of Symbolic Computation
  23. Complexity of computations
    Michael O. Rabin · 1977 · Communications of the ACM
  24. VLSI Design of a Large-Number Multiplier for Fully Homomorphic Encryption
    Wei Wang, Xinming Huang, Niall Emmart, Charles Weems · 2013 · IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  25. Designing an FPGA-Accelerated Homomorphic Encryption Co-Processor
    David Bruce Cousins, Kurt R. Rohloff, Daniel Sumorok · 2016 · IEEE Transactions on Emerging Topics in Computing
  26. Evaluation of Large Integer Multiplication Methods on Hardware
    Ciara Rafferty, Maire P. O'Neill, Neil Hanley · 2017 · IEEE Transactions on Computers
  27. Queries with arithmetical constraints
    Stéphane Grumbach, Jianwen Su · 1997 · Theoretical Computer Science
  28. Open problems in number theoretic complexity, II
    Leonard M. Adleman, Kevin S. McCurley · 1994 · Lecture notes in computer science
  29. Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]
    Peter Kirrinnis · 1998 · Journal of Complexity
  30. Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
    Mikkel Thorup · 2002 · Journal of Algorithms
  31. Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods
    Yanwei Gong, Xiaolin Chang, Jelena Mišić, Vojislav B. Mišić, Jianhua Wang, Haoran Zhu · 2024 · Cybersecurity
  32. Detecting perfect powers in essentially linear time
    Daniel Bernstein · 1998 · Mathematics of Computation
  33. Fast evaluation of holonomic functions
    Joris van der Hoeven · 1999 · Theoretical Computer Science
  34. Faster Polynomial Multiplication over Finite Fields
    David Harvey, Joris van der Hoeven, Grégoire Lecerf · 2017 · Journal of the ACM
  35. Homomorphic AES evaluation using the modified LTV scheme
    Yarkın Doröz, Yin Hu, Berk Sunar · 2015 · Designs Codes and Cryptography
  36. Factorization of Multivariate Polynomials Over Finite Fields
    Joachim von zur Gathen, Erich Kaltofen · 1985 · Mathematics of Computation
  37. Algorithms for Monitoring Real-Time Properties
    David Basin, Felix Klaedtke, Eugen Zălinescu · 2012 · Lecture notes in computer science
  38. Fast computation of special resultants
    Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost · 2005 · Journal of Symbolic Computation
  39. The Complexity of Computations
    Pavel Pudlák · 2013 · Springer monographs in mathematics
  40. Irregular Primes to One Million
    Joe Buhler, Richard E. Crandall, R. W. Sompolski · 1992 · Mathematics of Computation
  41. Low-Dimensional Lattice Basis Reduction Revisited
    Phong Q. Nguyễn, Damien Stehlé · 2004 · Lecture notes in computer science
  42. Distortion‐Free Steganography for Polygonal Meshes
    Alexander Bogomjakov, Craig Gotsman, Martin Isenburg · 2008 · Computer Graphics Forum
  43. Acceleration of Euclidean Algorithm and Rational Number Reconstruction
    Xinmao Wang, Victor Ya. Pan · 2003 · SIAM Journal on Computing
  44. COMPUTING IMAGES OF GALOIS REPRESENTATIONS ATTACHED TO ELLIPTIC CURVES
    Andrew V. Sutherland · 2016 · Forum of Mathematics Sigma
  45. P, NP and mathematics - a computational complexity perspective
    Avi Wigderson · 2006 · Dialnet (Universidad de la Rioja)
  46. On Orders of Optimal Normal Basis Generators
    Shuhong Gao, Scott A. Vanstone · 1995 · Mathematics of Computation
  47. Information theory and the complexity of boolean functions
    Nicholas J. Pippenger · 1976 · Theory of Computing Systems
  48. A Binary Recursive Gcd Algorithm
    Damien Stehlé, Paul Zimmermann · 2004 · Lecture notes in computer science
  49. Constructing normal bases in finite fields
    Joachim von zur Gathen, Mark W. Giesbrecht · 1990 · Journal of Symbolic Computation
  50. A Division-Free Toom–Cook Multiplication-Based Montgomery Modular Multiplication
    Zhen Gu, Shuguo Li · 2018 · IEEE Transactions on Circuits & Systems II Express Briefs
  51. PDA: a privacy‐preserving dual‐functional aggregation scheme for smart grid communications
    Chen Li, Rongxing Lu, Hui Li, Le Chen, Jie Chen · 2015 · Security and Communication Networks
  52. FPGA implementation of a large-number multiplier for fully homomorphic encryption
    Wei Wang, Xinming Huang · 2013 · IEEE International Symposium on Circuits and Systems proceedings
  53. Computational Complexity of Fourier Transforms Over Finite Fields
    F. P. Preparata, D.V. Sarwate · 1977 · Mathematics of Computation
  54. On the bit-complexity of sparse polynomial and series multiplication
    Joris van der Hoeven, Grégoire Lecerf · 2012 · Journal of Symbolic Computation
  55. An 0(n) Parallel Multiplier with Bit-Sequential Input and Output
    I-Ngo Chen, Willoner · 1979 · IEEE Transactions on Computers
  56. HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES
    Niall Emmart, Charles Weems · 2011 · Parallel Processing Letters
  57. Fast Modular Reduction
    William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal · 2007 · IEEE Symposium on Computer Arithmetic (ARITH)
  58. More on squaring and multiplying large integers
    Dan Zuras · 1994 · IEEE Transactions on Computers
  59. Asymmetric Squaring Formulae
    Jaewook Chung, M.A. Hasan · 2007 · IEEE Symposium on Computer Arithmetic (ARITH)
  60. Factoring numbers using singular integers
    Leonard M. Adleman · 1991 · ACM Symposium on Theory of Computing (STOC)
  61. Realizing Boolean functions on disjoint sets of variables
    Wolfgang J. Paul · 1976 · Theoretical Computer Science
  62. Solving structured linear systems with large displacement rank
    Alin Bostan, Claude-Pierre Jeannerod, Éric Schost · 2008 · Theoretical Computer Science
  63. Multiprecision multiplication on AVR revisited
    Michael Hutter, Peter Schwabe · 2015 · Journal of Cryptographic Engineering
  64. More Efficient Algorithms for the NTRU Key Generation Using the Field Norm
    Thomas Pornin, Thomas Prest · 2019 · Lecture notes in computer science
  65. Integer and polynomial multiplication
    Marco Bodrato, Alberto Zanoni · 2007 · International Symposium on Symbolic and Algebraic Computation
  66. Elliptic periods for finite fields
    Jean-Marc Couveignes, Reynald Lercier · 2008 · Finite Fields and Their Applications
  67. Computing modular polynomials in quasi-linear time
    Andreas Enge · 2009 · Mathematics of Computation
  68. Exact sampling and counting for fixed-margin matrices
    Jeffrey W. Miller, Matthew Tom Harrison · 2013 · The Annals of Statistics
  69. How to fool an unbounded adversary with a short key
    Alexander C. Russell, Hong Wang · 2006 · IEEE Transactions on Information Theory
  70. Computing the sign or the value of the determinant of an integer matrix, a complexity survey
    Erich Kaltofen, Gilles Villard · 2003 · Journal of Computational and Applied Mathematics
  71. The complexity of computing the number of strings of given length in context-free languages
    Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini · 1991 · Theoretical Computer Science
  72. Fast Multipoint Evaluation of Bivariate Polynomials
    Michael Nüsken, Martin Ziegler · 2004 · Lecture notes in computer science
  73. Fast polynomial factorization over high algebraic extensions of finite fields
    Erich Kaltofen, Victor Shoup · 1997 · International Symposium on Symbolic and Algebraic Computation
  74. Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
    David Harvey, Joris van der Hoeven · 2022 · Journal of the ACM
  75. Computing sums of radicals in polynomial time
    Johannes Blömer · 2002 · Annual Symposium on Foundations of Computer Science
  76. Approximations and complex multiplication according to Ramanujan
    David V. Chudnovsky, Gregory V. Chudnovsky · 1988 · Springer eBooks
  77. Some Techniques for Solving Recurrences
    George S. Lueker · 1980 · ACM Computing Surveys
  78. Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
    James Weldon Demmel, Plamen Koev · 2005 · Linear Algebra and its Applications
  79. Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular Reduction.
    Xiaolin Cao, Ciara Moore, Maire P. O'Neill, Elizabeth O’Sullivan, Neil Hanley · 2013
  80. Factoring polynomials and primitive elements for special primes
    Joachim von zur Gathen · 1987 · Theoretical Computer Science
  81. Gauss periods and fast exponentiation in finite fields
    Shuhong Gao, Joachim von zur Gathen, Daniel Panario · 1995 · Lecture notes in computer science
  82. High-Speed Fully Homomorphic Encryption Over the Integers
    Xiaolin Cao, Ciara Rafferty, Maire P. O'Neill, Neil Hanley, Elizabeth O’Sullivan · 2014 · Lecture notes in computer science
  83. Evaluating the Hardware Performance of a Million-Bit Multiplier
    Yarkın Doröz, Erdinç Öztürk, Berk Sunar · 2013 · Euromicro Conference on Digital System Design (DSD)
  84. Higher Newton polygons and integral bases
    Jordi Guàrdia, Jesús Montes, Enric Nart · 2014 · Journal of Number Theory
  85. Tensors in computations
    Lek‐Heng Lim · 2021 · Acta Numerica
  86. On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
    Takakazu Satoh · 2002 · Lecture notes in computer science
  87. Computing Hermite and Smith normal forms of triangular integer matrices
    Arne Storjohann · 1998 · Linear Algebra and its Applications
  88. Andrei Nikolaevich Kolmogorov (1903-1987)
    David George Kendall, George Keith Batchelor, Ν. H. Bingham, Walter Kurt Hayman, J. M. E. Hyland, G. G. Lorentz, H. K. Moffatt, W. Parry, Alexander Alexandrovich Razborov, C. A. Robinson et al. · 1990 · Bulletin of the London Mathematical Society
  89. Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time
    David Harvey, Andrew V. Sutherland · 2014 · LMS Journal of Computation and Mathematics
  90. Complexity results for triangular sets
    Éric Schost · 2003 · Journal of Symbolic Computation
  91. 20 Years of ECM
    Paul Zimmermann, Bruce Dodson · 2006 · Lecture notes in computer science
  92. An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
    Jan Denef, Fréderik Vercauteren · 2005 · Journal of Cryptology
  93. On the complexity of finding short vectors in integer lattices
    Erich Kaltofen · 1983 · Lecture notes in computer science
  94. Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption
    Xiaolin Cao, Ciara Rafferty, Maire P. O'Neill, Elizabeth O’Sullivan, Neil Hanley · 2015 · IEEE Transactions on Computers
  95. How to Fool an Unbounded Adversary with a Short Key
    Alexander C. Russell, Hong Wang · 2002 · Lecture notes in computer science
  96. An output-sensitive algorithm for persistent homology
    Chao Chen, Michael Kerber · 2012 · Computational Geometry
  97. The complexity of computations by networks
    Nicholas J. Pippenger · 1987 · IBM Journal of Research and Development
  98. Complexity of computation in finite fields
    Sergey Borisovich Gashkov, I. S. Sergeev · 2013 · Journal of Mathematical Sciences
  99. Two-factor authentication for the Bitcoin protocol
    Christopher Mann, Daniel Loebenberger · 2016 · International Journal of Information Security
  100. Fast multiprecision evaluation of series of rational numbers
    Bruno Haible, Thomas Papanikolaou · 1998 · Lecture notes in computer science