Efficient polynomial time algorithms computing industrial-strength primitive roots

DOI10.1016/j.ipl.2005.09.014zbMath1185.68311OpenAlexW2157832034MaRDI QIDQ1045890

Jacques Dubrois, Jean-Guillaume Dumas

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.014

zbMATH Keywords

computational complexitycryptographyrandomized algorithms

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20)

Related Items (2)

An elliptic curve analogue of Pillai’s lower bound on primitive roots ⋮ On the existence of pairs of primitive normal elements over finite fields

Cites Work

• Orders of Gauss periods in finite fields
• Comments on search procedures for primitive roots
• On the Average of the Least Primitive Root Modulo p

This page was built for publication: Efficient polynomial time algorithms computing industrial-strength primitive roots