Schnelle Multiplikation großer Zahlen

Cited by (1,000)

Items 601–700 of 1,000

1. The Truncated Fourier Transform for Mixed Radices
   Robin Larrieu · 2017 · International Symposium on Symbolic and Algebraic Computation
2. Towards an on-chip signal processing solution for the online calibration of SS-OCT systems
   Oscar Barajas, Amir Tofighi Zavareh, Sebastián Hoyos · 2017 · IEEE International Symposium on Circuits and Systems proceedings
3. Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
   Joris van der Hoeven, Robin Larrieu · 2019 · ACM communications in computer algebra
4. Parameterized and exact algorithms for class domination coloring
   R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale · 2020 · Discrete Applied Mathematics
5. Towards FHE in Embedded Systems: A Preliminary Codesign Space Exploration of a HW/SW Very Large Multiplier
   Ghada Y. Abozaid, Arnaud Tisserand, Ahmed El-Mahdy, Yasutaka Wada · 2015 · IEEE Embedded Systems Letters
6. A method of constructing fast algorithms in the k-valued logic
   Valeriy B. Alekseev, N. R. Emel'yanov · 1985 · Mathematical Notes
7. Big Prime Field FFT on Multi-core Processors
   Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Linxiao Wang · 2019 · International Symposium on Symbolic and Algebraic Computation
8. Fast in-place algorithms for polynomial operations
   Pascal Giorgi A, Bruno Grenet, Daniel S. Roche · 2020 · International Symposium on Symbolic and Algebraic Computation
9. Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division
   Timur R. Seifullin · 2002 · Cybernetics and Systems Analysis
10. Quantum Formulas: A Lower Bound and Simulation
    Vwani Roychowdhury, Farrokh Vatan · 2001 · SIAM Journal on Computing
11. Efficient evaluation of polynomial forms
    Ian Munro, Allan Borodin · 1972 · Journal of Computer and System Sciences
12. Efficient Parallel Pseudorandom Number Generation
    John H. Reif, J. D. Tygar · 1988 · SIAM Journal on Computing
13. Two infinite sets of primes with fast primality tests
    J. Pintz, William Steiger, Endre Szemerédi · 1988 · ACM Symposium on Theory of Computing (STOC)
14. Fast computer algebra
    Lamagna · 1982 · Computer
15. 10 trillion digits of pi: A case study of summing hypergeometric series to high precision on multicore systems
    Alexander Yee, Shigeru Kondo · 2011 · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
16. Arbitrary precision arithmetic in Algol 68
    J. L. Schonfelder, J. T. Thomason · 1979 · Software Practice and Experience
17. Fast Multiplication of Large Integers: Implementation and Analysis of the DKSS Algorithm
    Christoph Lüders · 2015 · arXiv (Cornell University)
18. Low complexity and hardware-friendly spectral modular multiplication
    Donald Donglong Chen, Gavin Xiaoxu Yao, Çetin Kaya Koç, Ray C. C. Cheung · 2012 · International Conference on Field-Programmable Technology (FPT)
19. QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS
    CHEN-FU CHIANG · 2013 · International Journal of Quantum Information
20. Algorithmic theory of free solvable groups: Randomized computations
    Alexander Ushakov · 2014 · Journal of Algebra
21. Hyperellipsoidal neuron
    Carlos Villaseñor, Nancy Arana‐Daniel, Alma Y. Alanís, Carlos López-Franco · 2017 · International Joint Conference on Neural Networks (IJCNN)
22. Multiplication with Fourier Optics Simulating 16-Bit Modular Multiplication
    Abigail N. Timmel, John T. Daly · 2018 · IEEE International Conference on Rebooting Computing (ICRC)
23. Area-Efficient Modular Reduction Structure and Memory Access Scheme for NTT
    Wenbo Guo, Shuguo Li · 2021 · IEEE International Symposium on Circuits and Systems proceedings
24. Algorithm for Calculation the Carry and Borrow Signs in Multi-digit Operations in the Parallel Computational Model
    Andrii Tereshchenko, V. K. Zadiraka · 2023 · International Journal of Computing
25. Fault-Tolerant Computation Meets Network Coding: Optimal Scheduling in Parallel Computing
    Congduan Li, Yiqian Zhang, Chee Wei Tan · 2023 · IEEE Transactions on Communications
26. Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration
    Andrey Kim, Ahmet Can Mert, Anisha Mukherjee, Aikata Aikata, Maxim Anatolievich Deryabin, Sunmin Kwon, Hyung Chul Kang, Sujoy Sinha Roy · 2024 · Lecture notes in computer science
27. A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer
    Daisuke Takahashi · 2008 · Lecture notes in computer science
28. Fast evaluation of the hypergeometric function p F p−1(a; b; z) at the singular point z = 1 by means of the Hurwitz zeta function ζ(α, s)
    Alexey I. Bogolubsky, С. Л. Скороходов · 2006 · Programming and Computer Software
29. Integer programming with 2-variable equations and 1-variable inequalities
    Manuel Bodirsky, Gustav Nordh, Timo von Oertzen · 2009 · Information Processing Letters
30. Finite Field Towers: Iterated Presentation and Complexity of Arithmetic
    Valentine B. Afanassiev, Alexander A. Davydov · 2002 · Finite Fields and Their Applications
31. Efficient Implementation of Modular Division by Input Bit Splitting
    Danila Gorodecky, Tiziano Villa · 2019 · IEEE Symposium on Computer Arithmetic (ARITH)
32. Efficient high-precision integer multiplication on the GPU
    Adrián Perez Diéguez, Margarita Amor, Ramón Doallo, Akira Nukada, Satoshi Matsuoka · 2022 · The International Journal of High Performance Computing Applications
33. Amortized multi-point evaluation of multivariate polynomials
    Joris van der Hoeven, Grégoire Lecerf · 2022 · Journal of Complexity
34. Communication Complexity
    Alexander Alexandrovich Razborov · 2011 · Springer eBooks
35. Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
    Tong-Wook Shinn, Tadao Takaoka · 2014 · Lecture notes in computer science
36. Algorithms for the universal decomposition algebra
    Romain Lebreton, Éric Schost · 2012 · International Symposium on Symbolic and Algebraic Computation
37. The delay of circuits whose inputs have specified arrival times
    Dieter Rautenbach, Christian Szegedy, Jürgen Werber · 2007 · Discrete Applied Mathematics
38. Chinese remainder theorem for cyclotomic polynomials in Z[X]
    Kamalakshya Mahatab, Kannappan Sampath · 2015 · Journal of Algebra
39. On the parameterized complexity of b-chromatic number
    Fahad Panolan, Geevarghese Philip, Saket Saurabh · 2016 · Journal of Computer and System Sciences
40. A primality test for 𝐾𝑝ⁿ+1 numbers
    J. M. Grau, Antonio M. Oller‐Marcén, Daniel Sadornil · 2014 · Mathematics of Computation
41. An in-place truncated Fourier transform
    Nicholas Coxon · 2021 · Journal of Symbolic Computation
42. Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
    Hanno Becker, Vincent Hwang, Matthias J. Kannwischer, Lorenz Panny, Bo‐Yin Yang · 2022 · Lecture notes in computer science
43. The LLL Algorithm and Integer Programming
    Karen Aardal, Friedrich Eisenbrand · 2009 · Information security and cryptography
44. Analysis of Rabin's polynomial irreducibility test
    Daniel Panario, Alfredo Viola · 1998 · Lecture notes in computer science
45. Inapproximability Results for Equations over Finite Groups
    Lars Engebretsen, Jonas Holmerin, Alexander C. Russell · 2002 · Lecture notes in computer science
46. A framework for deterministic primality proving using elliptic curves with complex multiplication
    Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, Angela Wong · 2015 · Mathematics of Computation
47. Analysis of Rabin's irreducibility test for polynomials over finite fields
    Daniel Panario, Boris G. Pittel, Bruce Richmond, Alfredo Viola · 2001 · Random Structures and Algorithms
48. A parallel implementation for polynomial multiplication modulo a prime
    Marshall Law, Michael Monagan · 2015 · Parallel Symbolic Computation
49. Symmetric subresultants and applications
    Philippe Saux Picart, Cyril Brunie · 2007 · Journal of Symbolic Computation
50. Architectures for Fast Modular Multiplication
    Ahmet Arış, Berna Örs, Gökay Saldamlı · 2011 · Euromicro Conference on Digital System Design (DSD)
51. FPGA implementation of the multiplication operation in multiple-precision arithmetic
    Kamil Rudnicki, Tomasz P. Stefański · 2017 · International Conference Mixed Design of Integrated Circuits and Systems
52. Algorithms: A Top-Down Approach
    Rod Howell · 2003
53. Bisection and Interpolation Methods
    John Michael McNamee, Victor Ya. Pan · 2013 · Studies in computational mathematics
54. Fast convolutions meet Montgomery
    Preda Mihăilescu · 2007 · Mathematics of Computation
55. Vectorization of multiple-precision arithmetic program and 201,326,000 decimal digits of pi calculation
    Yasumasa Kanada · 2003
56. Algorithmes de calcul de logarithmes discrets dans les corps finis
    Emmanuel Thomé · 2003 · HAL (Le Centre pour la Communication Scientifique Directe)
57. Computing components and projections of curves over finite fields
    Joachim von zur Gathen, Igor E. Shparlinski · 1998 · SIAM Journal on Computing
58. Comments to my works, written by myself
    Anatolii Alekseevich Karatsuba · 2013 · Proceedings of the Steklov Institute of Mathematics
59. Fast algorithms for complex integer transforms
    Kwang Liu, I.S. Reed, T. K. Truong · 1977 · IEEE Transactions on Acoustics Speech and Signal Processing
60. Elliptic formal groups over ℤ and F p in applications to number theory, computer science and topology
    David V. Chudnovsky, Gregory V. Chudnovsky · 1988 · Lecture notes in mathematics
61. Arithmétique modulaire pour la cryptographie
    Thomas Plantard · 2005 · HAL
62. COFFEE: Cross-Layer Optimization for Fast and Efficient Executions of Sinkhorn-Knopp Algorithm on HPC Systems
    Chengyu Sun, Huizhang Luo, Hong Jiang, Jeff Jun Zhang, Kenli Li · 2023 · IEEE Transactions on Parallel and Distributed Systems
63. A Survey of Polynomial Multiplications for Lattice-Based Cryptosystems
    Vincent Hwang · 2024 · IACR Communications in Cryptology
64. An efficient large-scale privacy amplification scheme exceeding 10G bits for quantum key distribution
    Xi Cheng, Haokun Mao, Hongwei Xu, Qiong Li · 2025 · EPJ Quantum Technology
65. New higher-order methods for the simultaneous inclusion of polynomial zeros
    Miodrag S. Petković, Mimica Milošević, Dusan M. Milosevic · 2011 · Numerical Algorithms
66. Сложность вычислений булевых функций
    A. D. Korshunov · 2012 · Успехи математических наук
67. On the Security of Secret Sharing Over a Ring and the Fast Implementation
    Hongru Cao, Sian-Jheng Lin, Weiming Zhang, Yunghsiang Sam Han · 2019 · IEEE Signal Processing Letters
68. Fast Mersenne prime testing on the GPU
    Andrew Thall · 2011
69. A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic
    Thomas Steinke, Raazesh Sainudiin · 2010 · Electronic Proceedings in Theoretical Computer Science
70. Vectorization of multiple-precision arithmetic program and 201,326,000 decimal digits of pi calculation (1988)
    Yasumasa Kanada · 2016 · Springer eBooks
71. Multiplying very large integer in GPU with pascal architecture
    Boon-Chiao Chang, Bok‐Min Goi, Raphaël C.‐W. Phan, Wai‐Kong Lee · 2018 · IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE)
72. Numerical and Non-Asymptotic Analysis of Elias’s and Peres’s Extractors with Finite Input Sequences
    Amonrat Prasitsupparote, Norio Konno, Junji Shikata · 2018 · Entropy
73. Efficient Comparison and Addition for FHE With Weighted Computational Complexity Model
    Neng Zhang, Qiao Qin, Zongsheng Hou, Bohan Yang, Shouyi Yin, Shaojun Wei, Leibo Liu · 2020 · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
74. Efficient Architecture for Long Integer Modular Multiplication over Solinas Prime
    Zheang Huai, Keshab K. Parhi, Xinmiao Zhang · 2021 · SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems
75. Efficient Hardware Implementation Architectures for Long Integer Modular Multiplication over General Solinas Prime
    Zheang Huai, Jingbo Zhou, Xinmiao Zhang · 2022 · Journal of Signal Processing Systems
76. An ultra-compact and high-speed FFT-based large-integer multiplier for fully homomorphic encryption using a dual spike-based arithmetic circuit over GF(p)
    Luis Garcia, Eduardo Vázquez, Gabriel Sanchez-Perez, Juan-Gerardo Avalos, Giovanny Sánchez · 2022 · Neurocomputing
77. Efficient Generic Quotients Using Exact Arithmetic
    Stephen M. Watt · 2023 · International Symposium on Symbolic and Algebraic Computation
78. Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
    Pascal Koiran, Subhayan Saha · 2023 · Computational Complexity
79. Fast norm computation in smooth-degree Abelian number fields
    Daniel J. Bernstein · 2023 · Research in Number Theory
80. A quantum primality test with order finding
    A. Donís Vela, Juan Carlos García-Escartín · 2018 · Quantum Information and Computation
81. Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
    Federico Amadio Guidi, Sofia Lindqvist, Giacomo Micheli · 2018 · Mathematics of Computation
82. Fast Hermite interpolation and evaluation over finite fields of characteristic two
    Nicholas Coxon · 2019 · Journal of Symbolic Computation
83. A Generalized RNS Mclaughlin Modular Multiplication with Non-Coprime Moduli Sets
    Zhen Gu, Shuguo Li · 2019 · IEEE Transactions on Computers
84. Number systems in modular rings and their applications to "error-free" computations
    IPSI RAS – Branch of the FSRC “Crystallography and Photonics” RAS, V.M. Chernov · 2019 · Computer Optics
85. Multiplication Algorithm Based on Collatz Function
    David Barina · 2020 · Theory of Computing Systems
86. Speeding up the Multiplication Algorithm for Large Integers
    Hazem M. Bahig, Amer AlGhadhban, M. A. Mahdi, Khaled A. Al-Utaibi, Hazem M. Bahig · 2020 · Engineering Technology & Applied Science Research
87. Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms
    Lorenzo De Stefani · 2022 · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
88. ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS
    Alice C. Niemeyer, Tomasz Popiel, Cheryl E. Praeger · 2012 · Bulletin of the Australian Mathematical Society
89. VLI – A Library for High Precision Integer and Polynomial Arithmetic
    Timothée Ewart, Andreas Hehn, Matthias Troyer · 2013 · Lecture notes in computer science
90. Faster FPTASes for Counting and Random Generation of Knapsack Solutions
    Roméo Rizzi, Alexandru Ioan Tomescu · 2014 · Lecture notes in computer science
91. Partially Interleaved Modular Karatsuba-Ofman Multiplication
    Gökay Saldamlı, YoJin Baek, Levent Ertaul · 2015
92. High-performance NTT architecture for large integer multiplication
    Jheng-Hao Ye, Ming‐Der Shieh · 2018 · International Symposium on VLSI Design, Automation and Test
93. Squeezing Feasibility
    Walter Dean · 2016 · Lecture notes in computer science
94. All Pairs Shortest Paths via Matrix Multiplication
    Tadao Takaoka · 2015 · Springer eBooks
95. Divide and conquer techniques for the polynomial root-finding problem
    Dario A. Bini · 1996 · De Gruyter eBooks
96. Instruction sequence expressions for the Karatsuba multiplication algorithm
    Jan Aldert Bergstra, Cornelis A. Middelburg · 2013 · Data Archiving and Networked Services (DANS)
97. Computerizing Mathematics: Logic and Computation
    Michael J. Beeson · 1990 · Oxford University Press eBooks
98. A fast eikonal equation solver using the Schrodinger wave equation
    Karthik S. Gurumoorthy, Peter, Adrian M., Guan, Birmingham Hang, Rangarajan, Anand · 2014 · arXiv (Cornell University)
99. Arithmetic in Basic Algebraic Domains
    George E. Collins, Maurice Mignotte, Franz Winkler · 1982 · Computing. Supplementum
100. Symbolic Mathematical Computation 1965–1975
     Robert M. Corless, Arthur C. Norman, Tomas Recio, William J. Turkel, Stephen M. Watt · 2025 · International Symposium on Symbolic and Algebraic Computation