Schnelle Multiplikation großer Zahlen

Cited by (1,000)

Items 301–400 of 1,000

1. Efficient Decomposition of Associative Algebras over Finite Fields
   Wayne Eberly, Mark W. Giesbrecht · 2000 · Journal of Symbolic Computation
2. Algorithmic number theory-the complexity contribution
   Leonard M. Adleman · 2002 · Annual Symposium on Foundations of Computer Science
3. Cauchy index computation
   Thomas Lickteig, Marie-Françoise Roy · 1996 · CALCOLO
4. Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
   Wang, Xiangyu, Zhang, Yi-Chen, Li, Zhengyu, Xu, Bingjie, Yu, Song, Guo, Hong · 2017 · Quantum Information and Computation
5. Computing the bound of an Ore polynomial. Applications to factorization
   José Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro · 2018 · Journal of Symbolic Computation
6. Post-Quantum Era in V2X Security: Convergence of Orchestration and Parallel Computation
   Engin Zeydan, Yekta Türk, Berkin Aksoy, Yaman Yagiz Tasbag · 2022 · IEEE Communications Standards Magazine
7. Relaxed algorithms for p -adic numbers
   Jérémy Berthomieu, Joris van der Hoeven, Grégoire Lecerf · 2011 · Journal de Théorie des Nombres de Bordeaux
8. On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
   Guillaume Quintin, Morgan Barbier, Christophe Chabot · 2013 · IEEE Transactions on Information Theory
9. Products of ordinary differential operators by evaluation and interpolation
   Alin Bostan, Frédéric Chyzak, Nicolas Le Roux · 2008 · International Symposium on Symbolic and Algebraic Computation
10. An Efficient Multiplication Algorithm using Nikhilam Method
    Shri Prakash Dwivedi · 2013 · International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom)
11. Cognitive and Computational Complexity: Considerations from Mathematical Problem Solving
    Markus Pantsar · 2019 · Erkenntnis
12. An Implementation of Montgomery Modular Multiplication on FPGAs
    Xinkai Yan, Guiming Wu, Dong Wu, Fang Yan Zheng, Xianghui Xie · 2013 · International Conference on Information Science and Cloud Computing Companion (ISCC-C)
13. Geometric algorithms for algebraic curves and surfaces
    Michael Kerber · 2009
14. A loop structure optimization targeting high-level synthesis of fast number theoretic transform
    Kazushi Kawamura, Masao Yanagisawa, Nozomu Togawa · 2018 · International Symposium on Quality Electronic Design (ISQED)
15. Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
    Ivan Damgård, Gudmund Skovbjerg Frandsen · 2005 · Journal of Symbolic Computation
16. Inapproximability results for equations over finite groups
    Lars Engebretsen, Jonas Holmerin, Alexander C. Russell · 2003 · Theoretical Computer Science
17. Sequential solution to Kepler’s equation
    Jeremy J. Davis, Daniele Mortari, Christian Bruccoleri · 2010 · Celestial Mechanics and Dynamical Astronomy
18. Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
    Wangchen Dai, Donald Donglong Chen, Ray C. C. Cheung, Çetin Kaya Koç · 2016 · IEEE Transactions on Computers
19. FFT-like Multiplication of Linear Differential Operators
    Joris van der Hoeven · 2002 · Journal of Symbolic Computation
20. Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method
    Ke Ye, Lek‐Heng Lim · 2016 · Foundations of Computational Mathematics
21. Fast Management of Permutation Groups I
    László Babai, Eugene M. Luks, Ákos Seress · 1997 · SIAM Journal on Computing
22. Polynomial factorization over 𝔽₂
    Joachim von zur Gathen, Jürgen Gerhard · 2002 · Mathematics of Computation
23. Post-Quantum Blockchain-Based Data Sharing for IoT Service Providers
    Engin Zeydan, Yekta Türk, S. Bugrahan Ozturk, Hakan Mutlu, A. Anil Dundar · 2022 · IEEE Internet of Things Magazine
24. A survey of set accumulators for blockchain systems
    Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci · 2023 · Computer Science Review
25. Controlled non-uniform random generation of decomposable structures
    Alain Denise, Yann Ponty, Michel Termier · 2010 · Theoretical Computer Science
26. Reversible Karatsuba's Algorithm
    Luis Antônio Brasil Kowada, Renato Portugal, Celina M.H. de Figueiredo · 2006
27. Optimal 2-constraint satisfaction via sum–product algorithms
    Mikko Koivisto · 2006 · Information Processing Letters
28. Computing Puiseux series: a fast divide and conquer algorithm
    Adrien Poteaux, Martin Weimann · 2021 · Annales Henri Lebesgue
29. Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
    Nicolas Brisebarre, Mioara Joldeş, Jean‐Michel Muller, Ana-Maria Naneş, Joris Picot · 2020 · ACM Transactions on Mathematical Software
30. On squaring and multiplying large integers
    Dan Zuras · 2002 · IEEE Symposium on Computer Arithmetic (ARITH)
31. Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
    Adrien Poteaux, Marc Rybowicz · 2011 · Applicable Algebra in Engineering Communication and Computing
32. On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
    Igor E. Shparlinski, Andrew V. Sutherland · 2015 · LMS Journal of Computation and Mathematics
33. Generalized Fermat-Mersenne number theoretic transform
    Vassil S. Dimitrov, Todor Cooklev, Borislav D. Donevsky · 1994 · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing
34. Computation of π Using Arithmetic-Geometric Mean
    Eugene Salamin · 1976 · Mathematics of Computation
35. Efficient Strongly Universal and Optimally Universal Hashing
    Philipp Woelfel · 1999 · Lecture notes in computer science
36. Efficient Parallel Pseudo-Random Number Generation
    John H. Reif, J. D. Tygar · 2007 · Springer eBooks
37. Fast Computation of Bernoulli, Tangent and Secant Numbers
    Richard P. Brent, David Harvey · 2013 · Springer proceedings in mathematics & statistics
38. Parallel Modular Multiplication on Multi-core Processors
    Pascal Giorgi A, Laurent Imbert A, Thomas Izard A · 2013 · IEEE Symposium on Computer Arithmetic (ARITH)
39. Accelerating SWHE Based PIRs Using GPUs
    Wei Dai, Yarkın Doröz, Berk Sunar · 2015 · Lecture notes in computer science
40. A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs
    Mohamed Shaheen Elgamel, Abdulhalim Dandoush · 2015 · Ad Hoc Networks
41. On the complexity of inverting integer and polynomial matrices
    Arne Storjohann · 2015 · Computational Complexity
42. A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
    Gleb Beliakov, Yuri Matiyasevich · 2015 · BIT Numerical Mathematics
43. On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
    Alin Bostan, Claude-Pierre Jeannerod, Christophe Mouilleron, Éric Schost · 2017 · SIAM Journal on Matrix Analysis and Applications
44. Spectral Modular Exponentiation
    Gökay Saldamlı, Çetin Kaya Koç · 2007 · IEEE Symposium on Computer Arithmetic (ARITH)
45. Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
    Alin Bostan, Pierrick Gaudry, Éric Schost · 2004 · Lecture notes in computer science
46. Complexity of Automata, Brains, and Behavior
    Hans J. Bremermann · 1974 · Lecture notes in biomathematics
47. Regulator approximation and fundamental unit computation for real-quadratic orders
    Maurer, Markus · 2008 · Technischen Universität Darmstadt
48. A Novel Method of Modular Multiplication Based on Karatsuba-like Multiplication
    Zhen Gu, Shuguo Li · 2020 · IEEE Symposium on Computer Arithmetic (ARITH)
49. A comprehensive study of quantum arithmetic circuits
    Siyi Wang, Xiufan Li, Wei Lee, Suman Deb, Eugene Lim, Anupam Chattopadhyay · 2025 · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences
50. Design of an Area-Effcient Million-Bit Integer Multiplier Using Double Modulus NTT
    Xiang Peng Feng, Shuguo Li · 2017 · IEEE Transactions on Very Large Scale Integration (VLSI) Systems
51. Strong pseudoprimes to twelve prime bases
    Jonathan Sorenson, Jonathan Webster · 2016 · Mathematics of Computation
52. Iterative refinement for linear systems in variable-precision arithmetic
    Andrzej Kiełbasiński · 1981 · BIT Numerical Mathematics
53. Gauß Periods in Finite Fields
    Joachim von zur Gathen, Igor E. Shparlinski · 2001 · Springer eBooks
54. Refined analysis and improvements on some factoring algorithms
    Claus Peter Schnorr · 1982 · Journal of Algorithms
55. Efficient decomposition of separable algebras
    Wayne Eberly, Mark W. Giesbrecht · 2003 · Journal of Symbolic Computation
56. A fast algorithm for computing large Fibonacci numbers
    Daisuke Takahashi · 2000 · Information Processing Letters
57. Faster algorithms for the square root and reciprocal of power series
    David Harvey · 2010 · Mathematics of Computation
58. Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
    Dima Yu. Grigoriev · 1978 · Lecture notes in computer science
59. Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions
    Michael S. Paterson, Nicholas J. Pippenger, Uri Zwick · 2002 · Annual Symposium on Foundations of Computer Science
60. Exact analysis of performance models by the Method of Moments
    Giuliano Casale · 2011 · Performance Evaluation
61. A fast numerical algorithm for the composition of power series with complex coefficients
    Peter Markus Ritzmann · 1986 · Theoretical Computer Science
62. Generalization of the ball-collision algorithm
    J. Carmelo Interlando, Karan Khathuria, Nicole Rohrer, Joachim Rosenthal, Violetta Weger · 2020 · Journal of Algebra Combinatorics Discrete Structures and Applications
63. Faster min-plus product for monotone instances
    Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang · 2022 · ACM Symposium on Theory of Computing (STOC)
64. A search for Wilson primes
    Edgar Costa, Robert Gerbicz, David Harvey · 2014 · Mathematics of Computation
65. Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
    Selçuk Baktır, Berk Sunar · 2006 · ACM Southeast Regional Conference (ACMSE)
66. Toom-Cook 8-way for Long Integers Multiplication
    Alberto Zanoni · 2009 · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
67. A quasi-linear time algorithm for computing modular polynomials in dimension 2
    Enea Milio · 2015 · LMS Journal of Computation and Mathematics
68. Efficient Polynomial Multiplication via Modified Discrete Galois Transform and Negacyclic Convolution
    Ahmad Al Badawi, Bharadwaj Veeravalli, Khin Mi Mi Aung · 2018 · Advances in intelligent systems and computing
69. Polynomial multiplication over binary finite fields: new upper bounds
    Alessandro De Piccoli, Andrea Visconti, Ottavio G. Rizzo · 2019 · Journal of Cryptographic Engineering
70. Speeding Up the Pollard Rho Method on Prime Fields
    Jung Hee Cheon, Jin Hong, Min‐Kyu Kim · 2008 · Lecture notes in computer science
71. Minimum-complexity pairing functions
    Kenneth W. Regan · 1992 · Journal of Computer and System Sciences
72. Fast conversion algorithms for orthogonal polynomials
    Alin Bostan, Bruno Salvy, Éric Schost · 2009 · Linear Algebra and its Applications
73. Arithmetic in Basic Algebraic Domains
    George E. Collins, Maurice Mignotte, Franz Winkler · 1983 · Computing. Supplementum
74. Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve Cryptography
    Selçuk Baktır, Berk Sunar · 2006 · Lecture notes in computer science
75. (1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm
    André Weilert · 2000 · Journal of Symbolic Computation
76. Designing Checkers for Programs that Run in Parallel
    Ronitt Rubinfeld · 1996 · Algorithmica
77. An Area-Efficient Large Integer NTT-Multiplier Using Discrete Twiddle Factor Approach
    Zhenmin Li, Jingwei Ren, Gaoming Du, Zhenxing Tu, Xiaolei Wang, Yongsheng Yin, Yiming Ouyang · 2022 · IEEE Transactions on Circuits & Systems II Express Briefs
78. Quantum Circuit Design for Integer Multiplication Based on Schönhage–Strassen Algorithm
    Junhong Nie, Qinlin Zhu, Meng Li, Xiaoming Sun · 2023 · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
79. Efficient Barrett Modular Multiplication Based on Toom-Cook Multiplication
    Yue Hao, Weijiang Wang, Hua Dang, Guiyu Wang · 2023 · IEEE Transactions on Circuits & Systems II Express Briefs
80. An output-sensitive algorithm for persistent homology
    Chao Chen, Michael Kerber · 2011 · Annual Symposium on Computational Geometry (SoCG)
81. Modular Inverse Algorithms Without Multiplications for Cryptographic Applications
    Laszlo Hars · 2006 · EURASIP Journal on Embedded Systems
82. Taking roots over high extensions of finite fields
    Javad Doliskani, Éric Schost · 2013 · Mathematics of Computation
83. On Karatsuba Multiplication Algorithm
    Xianjin Fang, LI Long-shu · 2007 · International Symposium on Data, Privacy, and E-Commerce
84. On the computation of the HNF of a module over the ring of integers of a number field
    Jean‐François Biasse, Claus Fieker, Tommy Hofmann · 2016 · Journal of Symbolic Computation
85. A note on the multiple-recursive matrix method for generating pseudorandom vectors
    Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan · 2017 · Discrete Applied Mathematics
86. A fresh look at research strategies in computational cognitive science: The case of enculturated mathematical problem solving
    Regina E. Fabry, Markus Pantsar · 2019 · Synthese
87. Upper Bounds on the Computational Power of an Optical Model of Computation
    Damien Woods · 2005 · Lecture notes in computer science
88. Chunky and equal-spaced polynomial multiplication
    Daniel S. Roche · 2010 · Journal of Symbolic Computation
89. A Regular Layout for Parallel Multiplier of 0(Log2N) Time
    W.K. Luk · 1981 · Springer eBooks
90. Fast algorithms for differential equations in positive characteristic
    Alin Bostan, Éric Schost · 2009 · International Symposium on Symbolic and Algebraic Computation
91. Fast fraction-free triangularization of Bezoutians with applications to sub-resultant chain computation
    Dario A. Bini, Luca Gemignani · 1998 · Linear Algebra and its Applications
92. Fast 2-Variable Integer Programming
    Friedrich Eisenbrand, Günter Rote · 2001 · Lecture notes in computer science
93. Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures
    Roberto Maria Avanzi, Preda Mihăilescu · 2004 · Lecture notes in computer science
94. Asymptotically Fast GCD Computation in ℤ[i]
    André Weilert · 2000 · Lecture notes in computer science
95. Sato-Tate groups of 𝑦²=𝑥⁸+𝑐 and 𝑦²=𝑥⁷-𝑐𝑥.
    Francesc Fité, Andrew V. Sutherland · 2016 · Contemporary mathematics - American Mathematical Society
96. HIGH PRECISION INTEGER ADDITION, SUBTRACTION AND MULTIPLICATION WITH A GRAPHICS PROCESSING UNIT
    Niall Emmart, Charles Weems · 2010 · Parallel Processing Letters
97. Efficient methods for one-shot quantum communication
    Anurag Anshu, Rahul Jain · 2022 · npj Quantum Information
98. Fast Computations of the Exponential Function
    Timm Ahrendt · 1999 · Lecture notes in computer science
99. Exact image representation via a number‐theoretic Radon transform
    Shekhar S. Chandra, Imants Svalbe · 2014 · IET Computer Vision
100. Fast on-line integer multiplication
     Michael J. Fischer, Larry J. Stockmeyer · 1973 · ACM Symposium on Theory of Computing (STOC)