scientific article; zbMATH DE number 1303121

zbMATH Open0926.11091MaRDI QIDQ4249636FDOQ4249636

Authors: Damian Weber 

Publication date: 24 November 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

cryptographydiscrete logarithmsmethod of Coppersmith, Odlyzko and Schroeppelnumber field sieve method

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (12)

• Discrete logarithm in an arbitrary quotient ring of polynomials of one variable over a finite field
• Title not available (Why is that?)
• Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
• On the convergence of iterations for a method of solution of discrete logarithm representation problem by means of rational approximations
• Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
• Title not available (Why is that?)
• A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
• Title not available (Why is that?)
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Computing small discrete logarithms faster
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Computing discrete logarithms in quadratic orders

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)