Algorithmic Number Theory
From MaRDI portal
Publication:5465641
DOI10.1007/B98210zbMATH Open1125.11362OpenAlexW2791103999MaRDI QIDQ5465641FDOQ5465641
Authors: Damien Stehlé, Paul Zimmermann 
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98210
Recommendations
Cited In (26)
- Title not available (Why is that?)
- Performance of a GCD algorithm for Gaussian integers
- Two Fast GCD Algorithms
- Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test?
- Title not available (Why is that?)
- A novel fast hybrid GCD computation algorithm
- Jebelean-Weber's algorithm without spurious factors
- Extending the binary gcd algorithms
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
- Strong pseudoprimes to twelve prime bases
- Computing the \(k\)-resilience of a synchronized multi-robot system
- An extended Jebelean-Weber-Sedjelmaci GCD algorithm
- Probabilistic analyses of the plain multiple gcd algorithm
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- Counting composites with two strong liars
- Fast tabulation of challenge pseudoprimes
- The mixed binary Euclid algorithm
- An O(M(n) logn) Algorithm for the Jacobi Symbol
- Title not available (Why is that?)
- HS-based error correction algorithm for noisy binary GCD side-channel sequences
- Complexity of computation in finite fields
- On Schönhage's algorithm and subquadratic integer gcd computation
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- Robust HGCD with no backup steps
- A deterministic algorithm for finding \(r\)-power divisors
- Algorithmic Number Theory
This page was built for publication: Algorithmic Number Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465641)
