The discrete logarithm problem in some groups
\textit{H.~Riesel} [BIT 28, 839-851 (1988; Zbl 0665.10002)] studied the problem of the discrete logarithm \( a^x = b \) in the group of invertible elements \((\mathbb{Z}/m\mathbb{Z})^*\) of the residue ring \(\mathbb{Z}/m\mathbb{Z}\), where \(m\) is a composite number. In the present paper, assuming \(p\) is a fixed prime, the author proposes a method for solvability verification and solution of the discrete logarithm problem in the group of the reducible elements \((\mathbb{Z}/_p\mathbb{Z}[x]/ (F(x)))^*\) of the ring \({\mathbb{Z}/_p\mathbb{Z}}[x ]/ (F(x))\), where \(F(x)\) is a reducible polynomial.
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- Solvability of the problem of taking the discrete logarithm
- A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
- Discrete logarithm problem in GH and XTR scheme
- scientific article; zbMATH DE number 1979702 (Why is no real title available?)
- scientific article; zbMATH DE number 1409225 (Why is no real title available?)
- О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
- Public Key Cryptography - PKC 2005
- The One-More Discrete Logarithm Assumption in the Generic Group Model
This page was built for publication: The discrete logarithm problem in some groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960258)
