A binary recursive gcd algorithm
From MaRDI portal
Recommendations
Cited in
(30)- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- A deterministic algorithm for finding \(r\)-power divisors
- A novel fast hybrid GCD computation algorithm
- Extending the binary gcd algorithms
- The mixed binary Euclid algorithm
- Strong pseudoprimes to twelve prime bases
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Complexity of computation in finite fields
- Two Fast GCD Algorithms
- Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test?
- scientific article; zbMATH DE number 2154292 (Why is no real title available?)
- scientific article; zbMATH DE number 3995051 (Why is no real title available?)
- scientific article; zbMATH DE number 799776 (Why is no real title available?)
- An O(M(n) logn) Algorithm for the Jacobi Symbol
- An extended Jebelean-Weber-Sedjelmaci GCD algorithm
- Performance of a GCD algorithm for Gaussian integers
- On Schönhage's algorithm and subquadratic integer gcd computation
- Binary GCD like algorithms for some complex quadratic rings
- Counting composites with two strong liars
- Robust HGCD with no backup steps
- Fast tabulation of challenge pseudoprimes
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- HS-based error correction algorithm for noisy binary GCD side-channel sequences
- Extending Regev's quantum algorithm to elliptic curves
- A textbook solution for dynamic strings
- Computing the \(k\)-resilience of a synchronized multi-robot system
- Cryptanalysis of an outsourced modular inversion protocol
- Optimizing the half-gcd algorithm
- Jebelean-Weber's algorithm without spurious factors
- Probabilistic analyses of the plain multiple gcd algorithm
This page was built for publication: A binary recursive gcd algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465641)