scientific article
From MaRDI portal
Publication:3360980
zbMath0734.11073MaRDI QIDQ3360980
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyalgorithmscomputational complexityfinite groupsfinite fieldscryptographydiscrete logarithmcryptosystemsindex calculus algorithmsPohlig-Hellman algorithmShank's algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (18)
A reduction of semigroup DLP to classic DLP ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ Nonabelian sets with distinct \(k\)-sums ⋮ Analysis and design of a secure key exchange scheme ⋮ Applying quick exponentiation for block upper triangular matrices ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Baby-step giant-step algorithms for the symmetric group ⋮ Towards self-stabilizing blockchain, reconstructing totally erased blockchain ⋮ Discrete logarithm problem using index calculus method ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ Computation of discrete logarithms in prime fields ⋮ An interactive identification scheme based on discrete logarithms and factoring ⋮ On the security of the Lucas function ⋮ A note on cyclic groups, finite fields, and the discrete logarithm problem ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Function field sieve method for discrete logarithms over finite fields
This page was built for publication:
