Discrete logarithms in \(\mathrm{GF}(p)\)

DOI10.1007/BF01840433zbMath0631.12010MaRDI QIDQ1094455

Richard Schroeppel, Andrew M. Odlyzko, Don Coppersmith

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

algorithmssecurity analysiscryptosystemsdiscrete logarithmsheuristic running time

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Fast generation of prime numbers and secure public-key cryptographic parameters., A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Number of rational points of elliptic curves, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, Analysis and design of a secure key exchange scheme, A key distribution system equivalent to factoring, Mathematical problems in cryptology, Applying quick exponentiation for block upper triangular matrices, Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree, Algebraic generalization of Diffie-Hellman key exchange, Elimination ideal and bivariate resultant over finite fields, Solving sparse linear systems of equations over finite fields using bit-flipping algorithm, Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences, Some uses of microcomputers in number theory research, Discrete logarithm problem using index calculus method, Faster individual discrete logarithms in finite fields of composite extension degree, On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields, Computation of discrete logarithms in prime fields, Efficient signature generation by smart cards, Computational problems in the theory of finite fields, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic, Performance analysis of index calculus method, On the cubic sieve method for computing discrete logarithms over prime fields, A note on cyclic groups, finite fields, and the discrete logarithm problem, Special prime numbers and discrete logs in finite prime fields, One-way permutations on elliptic curves, Ephemeral key recovery using index calculus method, Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле, Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings, Non-interactive zero knowledge from sub-exponential DDH, On the security of cryptosystem using automorphism groups, Function field sieve method for discrete logarithms over finite fields, Solving linear equations over GF(2): Block Lanczos algorithm, Elliptic curve cryptosystems and their implementation, A short proof for explicit formulas for discrete logarithms in finite fields, The Complexity of Public-Key Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Gaussian elimination is not optimal
• Fast evaluation of logarithms in fields of characteristic two
• Solving sparse linear equations over finite fields
• On the Asymptotic Complexity of Matrix Multiplication
• A monte carlo method for factorization
• Methods of conjugate gradients for solving linear systems