Schnelle Multiplikation großer Zahlen

Cited by (1,000)

Items 501–600 of 1,000

1. Implementing Fast Carryless Multiplication
   Joris van der Hoeven, Robin Larrieu, Grégoire Lecerf · 2017 · Lecture notes in computer science
2. On the Design and Implementation of Efficient Zero-Knowledge Proofs of Knowledge
   Endre Bangerter, Stephan Krenn, Ahmad‐Reza Sadeghi, Thomas H. Schneider, Joe-Kai Tsay · 2009
3. Fast algorithm for “error-free” convolution computation using Mersenne–Lucas codes
   Vladimir M. Chernov · 2005 · Chaos Solitons & Fractals
4. Local computation of differents and discriminants
   Enric Nart · 2013 · Mathematics of Computation
5. Multi-Period Optimal Design of Online Auctions
   Shengli Chen, Xiaohua Yang, Luo Yun-feng · 2007 · International Symposium on Data, Privacy, and E-Commerce
6. Exact calculation of pattern probabilities
   Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan · 2010 · IEEE International Symposium on Information Theory (ISIT)
7. Big Prime Field FFT on the GPU
   Liangyu Chen, Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza · 2017 · International Symposium on Symbolic and Algebraic Computation
8. Efficient Hardware Implementation of the LEDAcrypt Decoder
   Kristjane Koleci, Paolo Santini, Marco Baldi, Franco Chiaraluce, Maurizio Martina, Guido Masera · 2021 · IEEE Access
9. Parallel sparse polynomial multiplication on modern hardware architectures
   Francesco Biscani · 2012 · International Symposium on Symbolic and Algebraic Computation
10. Exact real arithmetic using centred intervals and bounded error terms
    Jens Blanck · 2005 · The Journal of Logic and Algebraic Programming
11. AT/sup 2/-optimal Galois field multiplier for VLSI
    Martin Fürer, Kurt Mehlhorn · 1989 · IEEE Transactions on Computers
12. Deterministic elliptic curve primality proving for a special sequence of numbers
    Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong · 2013 · The Open Book Series
13. The Basic Polynomial Algebra Subprograms
    Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie · 2014 · Lecture notes in computer science
14. A fast optimal parallel algorithm for a short addition chain
    Hazem M. Bahig · 2017 · The Journal of Supercomputing
15. FFT-based McLaughlin's Montgomery Exponentiation without Conditional Selections
    Wangchen Dai, Donald Donglong Chen, Ray C. C. Cheung, Çetin Kaya Koç · 2018 · IEEE Transactions on Computers
16. Faster FPTASes for counting and random generation of Knapsack solutions
    Roméo Rizzi, Alexandru Ioan Tomescu · 2019 · Information and Computation
17. Fast amortized multi-point evaluation
    Joris van der Hoeven, Grégoire Lecerf · 2021 · Journal of Complexity
18. Linear Computation Coding
    Ralf R. Müller, Bernhard Gäde, Ali Bereyhi · 2021 · IEEE International Conference on Acoustics Speech and Signal Processing
19. Fast Computation of Some Special Integrals of Mathematical Physics
    Ekatherina Anatol'evna Karatsuba · 2001 · Springer eBooks
20. Structured FFT and TFT
    Joris van der Hoeven, Romain Lebreton, Éric Schost · 2013 · International Symposium on Symbolic and Algebraic Computation
21. Efficient algorithms for computing the Jacobi symbol
    Shawna Meyer Eikenberry, Jonathan Sorenson · 1996 · Lecture notes in computer science
22. A solution to the extended GCD problem with applications
    Arne Storjohann · 1997 · International Symposium on Symbolic and Algebraic Computation
23. On computational efficiency for multi-precision zero-finding methods
    Miquel Grau-Sánchez, José Luis Díaz‐Barrero · 2006 · Applied Mathematics and Computation
24. Computing in general abelian groups is hard
    Costas S. Iliopoulos · 1985 · Theoretical Computer Science
25. Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
    Dhananjay S. Phatak, Thomas E. Goff · 2005 · IEEE Symposium on Computer Arithmetic (ARITH)
26. A Probable Prime Test with Very High Confidence for n ≡ 3 mod 4
    E. Müller · 2003 · Journal of Cryptology
27. Quantum multiplication algorithm based on the convolution theorem
    Mehdi Ramezani, Morteza Nikaeen, Farnaz Farman, Seyed Mahmoud Ashrafi, Alireza Bahrampour · 2023 · Physical Review A
28. Efficient ECC Processor Designs for IoT Using Edwards Curves and Exploiting FPGA Embedded Components
    Osama D. Al-Khaleel, Selçuk Baktır, Mohammad D. Al-Khaleel, Alptekın Küpçü · 2024 · IEEE Access
29. Faster multiplication over $${\mathbb {F}}_2[X]$$ using AVX512 instruction set and VPCLMULQDQ instruction
    Jean-Marc Robert, Pascal Véron · 2022 · Journal of Cryptographic Engineering
30. A Real Elementary Approach to the Master Recurrence and Generalizations
    Chee Keng Yap · 2011 · Lecture notes in computer science
31. Instruction Sequences Expressing Multiplication Algorithms
    Jan Aldert Bergstra, Cornelis A. Middelburg · 2018 · Scientific Annals of Computer Science
32. Calculation of Bessel Functions via the Summation of Series
    Ekatherina Anatol'evna Karatsuba · 2019 · Numerical Analysis and Applications
33. CASA: A Compact and Scalable Accelerator for Approximate Homomorphic Encryption
    Pengzhou He, Samira Carolina Oliva Madrigal, Çetin Kaya Koç, Tianyou Bao, Jiafeng Xie · 2024 · IACR Transactions on Cryptographic Hardware and Embedded Systems
34. Congruent Number Theta Coefficients to 1012
    William B. Hart, Gonzalo Tornaría, Mark Watkins · 2010 · Lecture notes in computer science
35. A Systematic Design and Explanation of the Atrubin Multiplier
    Shimon Even, Ami Litman · 1993 · Springer eBooks
36. Computational complexity of Boolean functions
    A. D. Korshunov · 2012 · Russian Mathematical Surveys
37. The computational complexity of recognizing permutation functions
    Keju Ma, Joachim von zur Gathen · 1995 · Computational Complexity
38. Fast and precise Fourier transforms
    Joe Buhler, Mohammad Amin Shokrollahi, Volker Stemann · 2000 · IEEE Transactions on Information Theory
39. From implicit to recursive equations
    Joris van der Hoeven · 2018 · Applicable Algebra in Engineering Communication and Computing
40. An 𝑂(log²(𝑁)) time primality test for generalized Cullen numbers
    J. M. Grau, Antonio M. Oller‐Marcén · 2011 · Mathematics of Computation
41. Accelerating Large Integer Multiplication Using Intel AVX-512IFMA
    Takuya Edamatsu, Daisuke Takahashi · 2020 · Lecture notes in computer science
42. High Degree Toom'n'Half for Balanced and Unbalanced Multiplication
    Marco Bodrato · 2011 · IEEE Symposium on Computer Arithmetic (ARITH)
43. Fast algorithms for matrix normal forms
    Mark W. Giesbrecht · 1992 · Annual Symposium on Foundations of Computer Science
44. Befreundete Zahlen Ein zweitausend Jahre altes Thema der elementaren Zahlentheorie
    Walter Borho · 1981 · Birkhäuser Basel eBooks
45. Generic Reductions for In-place Polynomial Multiplication
    Pascal Giorgi A, Bruno Grenet, Daniel S. Roche · 2019 · International Symposium on Symbolic and Algebraic Computation
46. Efficient Software Implementation of the SIKE Protocol Using a New Data Representation
    Jing Tian, Piaoyang Wang, Zhe Liu, Jun Ting Lin, Zhongfeng Wang, Johann Großschädl · 2021 · IEEE Transactions on Computers
47. Doubly-Focused Enumeration of Pseudosquares and Pseudocubes
    Kjell Wooding, Hugh C. Williams · 2006 · Lecture notes in computer science
48. Efficient Parallel Multiplication Algorithm for Large Integers
    Viktor Bunimov, Manfred Schimmler · 2003 · Lecture notes in computer science
49. Algebraic Elimination of epsilon-transitions
    Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte · 2005 · Discrete Mathematics & Theoretical Computer Science
50. Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of calculation
    Daisuke Takahashi · 2010 · Parallel Computing
51. Complexity measures for matrix multiplication algorithms
    Francesco Romani · 1980 · CALCOLO
52. Inverting a Vandermonde matrix in minimum parallel time
    Franco P. Preparata · 1991 · Information Processing Letters
53. A fast computation of complex convolution using a hybrid transform
    I.S. Reed, T. K. Truong · 1978 · IEEE Transactions on Acoustics Speech and Signal Processing
54. Space-efficient evaluation of hypergeometric series
    Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima · 2005 · ACM SIGSAM Bulletin
55. Solution of Systems of Linear Equations by the p-Adic Method
    Gennadi Malaschonok · 2003 · Programming and Computer Software
56. Computing special powers in finite fields
    Joachim von zur Gathen, Michael Nöcker · 1999 · International Symposium on Symbolic and Algebraic Computation
57. Sublinear parallel algorithm for computing the greatest common divisor of two integers
    Ravi Kannan, Gary Lee Miller, Larry Rudolph · 1984 · Annual Symposium on Foundations of Computer Science
58. On the Complexity of Computing Prime Tables
    Martı́n Farach-Colton, Meng-Tsung Tsai · 2015 · Lecture notes in computer science
59. Faster Polynomial Multiplication via Discrete Fourier Transforms
    Alexey Pospelov · 2011 · Lecture notes in computer science
60. Families with Infants: A General Approach to Solve Hard Partition Problems
    Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin · 2014 · Lecture notes in computer science
61. Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
    Minkyu Kim, Jung Hee Cheon, In-Sok Lee · 2014 · Mathematics of Computation
62. AI-Completeness: Using Deep Learning to Eliminate the Human Factor
    Kristina Šekrst · 2020 · Springer eBooks
63. Quasi-optimal multiplication of linear differential operators
    Alexandre Benoit, Alin Bostan, Joris van der Hoeven, Van Der Hoeven · 2012
64. Small one-dimensional Euclidean preference profiles
    Jiehua Chen, Sven Grottke · 2021 · Social Choice and Welfare
65. Supercomputer Environment for Recursive Matrix Algorithms
    Gennadi Malaschonok, Alla Sidko · 2022 · Programming and Computer Software
66. Linear Computation Coding: A Framework for Joint Quantization and Computing
    Ralf R. Müller, Bernhard Gäde, Ali Bereyhi · 2022 · Algorithms
67. Efficient computation of the characteristic polynomial of a threshold graph
    Martin Fürer · 2016 · Theoretical Computer Science
68. “Error-free” calculation of the convolution using generalized Mersenne and Fermat transforms over algebraic fields
    Vladimir M. Chernov, Maria V. Pershina · 1997 · Lecture notes in computer science
69. Implementation of the DKSS Algorithm for Multiplication of Large Numbers
    Christoph Lüders · 2015 · International Symposium on Symbolic and Algebraic Computation
70. Power series solutions of singular (q)-differential equations
    Alin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, Romain Lebreton · 2012 · International Symposium on Symbolic and Algebraic Computation
71. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Martin Fürer · 2012 · Algorithmica
72. Analysis of algorithms on problems in general abelian groups
    Costas S. Iliopoulos · 1985 · Information Processing Letters
73. On the parallel computation thesis
    Nachum Dershowitz, Evgenia Falkovich · 2016 · Logic Journal of IGPL
74. Algorithms for Structured Linear Systems Solving and Their Implementation
    Seung Gyu Hyun, Romain Lebreton, Éric Schost · 2017 · International Symposium on Symbolic and Algebraic Computation
75. Efficiently Correcting Matrix Products
    Leszek Antoni Gąsieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama · 2016 · Algorithmica
76. Multiplication hits the speed limit
    Erica Klarreich · 2019 · Communications of the ACM
77. Heuristics for the Design of Large Multipliers for FPGAs
    Andreas Böttcher, Keanu Kullmann, Martin Kumm · 2020 · IEEE Symposium on Computer Arithmetic (ARITH)
78. Fast Fourier Transform Algorithms with Applications
    Gerhard Merz · 1983 · Springer eBooks
79. Fast Exact Bayesian Inference for Sparse Signals in the Normal Sequence Model
    Tim van Erven, Botond Szabó · 2020 · Bayesian Analysis
80. An Efficient Multicore Algorithm for Minimal Length Addition Chains
    Hazem M. Bahig, Yasser Kotb · 2019 · Computers
81. Fast Computation of ζ(3) and of Some Special Integrals Using the Ramanujan Formula and Polylogarithms
    Ekatherina Anatol'evna Karatsuba · 2001 · BIT Numerical Mathematics
82. Inversion of circulant matrices over Zm
    Dario A. Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara · 1998 · Lecture notes in computer science
83. A novel fast modular multiplier architecture for 8,192-bit RSA cryposystem
    Wei Wang, Xinming Huang · 2013 · IEEE High Performance Extreme Computing Conference
84. The bit-operation complexity of matrix multiplication and of all pair shortest path problem
    Victor Ya. Pan · 1981 · Computers & Mathematics with Applications
85. General Pattern Matching
    Alberto Apostolico · 1998 · Chapman & Hall/CRC applied algorithms and data structures series
86. Refined analysis and improvements on some factoring algorithms
    C. P. Schnorr · 1981 · Lecture notes in computer science
87. Large integer multiplication on hypercubes
    Barry S. Fagin · 1992 · Journal of Parallel and Distributed Computing
88. Some basic information on information-based complexity theory
    Beresford Ν. Parlett · 1992 · Bulletin of the American Mathematical Society
89. Functions equivalent to integer multiplication
    H. Alt · 1980 · Lecture notes in computer science
90. A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform
    R Reed, Truong · 1979 · IEEE Transactions on Computers
91. Lower Bounds for Multiplication via Network Coding
    Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen · 2019 · arXiv (Cornell University)
92. Extensions of dynamic programming for multi-stage combinatorial optimization
    Michal A. Mankowski, Mikhail Moshkov · 2020 · Theoretical Computer Science
93. An overview of computational complexity
    Stephen A Cook · 2007 · ACM eBooks
94. Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
    Adolfo R. Escobedo, Erick Moreno‐Centeno · 2017 · SIAM Journal on Matrix Analysis and Applications
95. Fast and scalable algorithm for product large data on multicore system
    Hazem M. Bahig, Hatem M. Bahig, Khaled Ahmed Mohamed Fathy · 2019 · Concurrency and Computation Practice and Experience
96. Explicit primality criteria for h · 2 n ± 1
    Yingpu Deng, Dandan Huang · 2016 · Journal de Théorie des Nombres de Bordeaux
97. Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations
    Christopher Lourenco, Erick Moreno‐Centeno · 2022 · SIAM Journal on Matrix Analysis and Applications
98. A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
    Kristjane Koleci, Paolo Mazzetti, Maurizio Martina, Guido Masera · 2023 · IEEE Access
99. A Fast Version of the Schur–Cohn Algorithm
    Cyril Brunie, Philippe Saux Picart · 2000 · Journal of Complexity
100. Investigation of the Performance of Nikhilam Multiplication Algorithm
     Can Eyüpoğlu · 2015 · Procedia - Social and Behavioral Sciences