scientific article; zbMATH DE number 1303121
From MaRDI portal
Publication:4249636
Recommendations
- Computation of discrete logarithms in an arbitrary finite field
- scientific article; zbMATH DE number 5532108
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Cited in
(14)- Computing discrete logarithms in quadratic orders
- A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Computing small discrete logarithms faster
- Discrete logarithm in an arbitrary quotient ring of polynomials of one variable over a finite field
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
- scientific article; zbMATH DE number 5532108 (Why is no real title available?)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 1302865 (Why is no real title available?)
- scientific article; zbMATH DE number 1113854 (Why is no real title available?)
- scientific article; zbMATH DE number 1522937 (Why is no real title available?)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
- On the convergence of iterations for a method of solution of discrete logarithm representation problem by means of rational approximations
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 Q4249636)
