Efficient polynomial time algorithms computing industrial-strength primitive roots

Abstract : E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at least half of his set should be generators. We show here that a slight variant of this set can indeed be made to contain a ratio of primitive roots as close to 1 as necessary. We thus derive several algorithms computing primitive roots correct with very high probability in polynomial time. In particular we present an asymptotically $O^{\sim}\left( \sqrt{\frac{1}{\epsilon}}log^1.5(p) + \log^2(p)\right)$ algorithm providing primitive roots of $p$ with probability of correctness greater than $1-\epsilon$ and several $O(log^\alpha(p))$, $\alpha \leq 5.23$ algorithms computing "Industrial-strength" primitive roots with probabilities e.g. greater than the probability of "hardware malfunctions".
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00002828
Contributor : Jean-Guillaume Dumas <>
Submitted on : Monday, December 8, 2008 - 4:51:19 PM
Last modification on : Monday, April 8, 2019 - 1:28:02 PM
Long-term archiving on : Friday, September 24, 2010 - 12:16:43 PM

Files

polypr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00002828, version 5
  • ARXIV : cs/0409029

Collections

INSMI | UGA | IMAG

Citation

Jacques Dubrois, Jean-Guillaume Dumas. Efficient polynomial time algorithms computing industrial-strength primitive roots. Information Processing Letters, Elsevier, 2006, 97 (2), pp.41-45. ⟨hal-00002828v5⟩

Share

Metrics

Record views

340

Files downloads

945