scientific article; zbMATH DE number 1113850
From MaRDI portal
Publication:4375624
zbMath0895.11054MaRDI QIDQ4375624
Damian Weber, Oliver Schirokauer, Thomas F. Denny
Publication date: 13 September 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
discrete logarithm problemclass grouppublic-key cryptographydigital signaturesnumber field sieveindex calculus methodcryptographic applicationsDiffie-Helman key exchangetheoretical aspects of algorithms
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (14)
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Computing the multiplicative group of residue class rings ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ A hidden number problem in small subgroups ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences ⋮ Local Duality and the Discrete Logarithm Problem ⋮ On the cubic sieve method for computing discrete logarithms over prime fields ⋮ Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Using number fields to compute logarithms in finite fields ⋮ An algorithm for evaluation of discrete logarithms in some nonprime finite fields ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups II
Uses Software
This page was built for publication:
