scientific article; zbMATH DE number 3280208
From MaRDI portal
Publication:5565227
Cited in
(18)- On the covering radius of cyclic linear codes and arithmetic codes
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Designs from pairs of finite fields. I: A cyclic unital U(6) and other regular Steiner 2-designs
- On the least k-th power non-residue
- On Artin's conjecture and Euclid's algorithm in global fields
- Artin's conjecture on average for composite moduli
- Constructions of \((q,k,1)\) difference families with \(q\) a prime power and \(k=4,5\)
- The least \(k\)-th power non-residue
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Statistical Evidence for Small Generating Sets
- Explicit Bounds for Primality Testing and Related Problems
- Comments on search procedures for primitive roots
- Improving two theorems of bose on difference families
- On factorisation, with a suggested new approach
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- On Artin's conjecture
- Matsuda monoids and Artin's primitive root conjecture
- Division fields of \(Y^ 2=X^ 3-aX\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565227)
