An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

DOI10.1109/TIT.1978.1055817zbMath0375.68023WikidataQ56784431 ScholiaQ56784431MaRDI QIDQ4154061

Martin Edward Hellman, Stephen C. Pohlig

Publication date: 1978

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

68P25: Data encryption (aspects in computer science)

65D20: Computation of special functions and constants, construction of tables

Related Items

Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝, Two phases encryption and its applications, Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Construction of CM Picard curves, Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree, Constructing nonresidues in finite fields and the extended Riemann hypothesis, Point counting on Picard curves in large characteristic, Another look at HMQV, On the deterministic complexity of factoring polynomials, Algebraic curves and cryptography, ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem, A traceable proxy multisignature scheme based on the elliptic curve cryptosystem, Sequence acquisition using bit estimation techniques, Constant-round perfect zero-knowledge computationally convincing protocols, Applying quick exponentiation for block upper triangular matrices, Studying the performance of artificial neural networks on problems related to cryptography, A discrete logarithm implementation of perfect zero-knowledge blobs, Low complexity normal bases for \(F_{2^{mn}}\), Low complexity normal bases, A note on Girault's self-certified model, Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N, A VLSI architecture for performing finite field arithmetic with reduced table lookup, A construction for authentication/secrecy codes from certain combinatorial designs, A key distribution system equivalent to factoring, A key-exchange system based on imaginary quadratic fields, Univariate polynomial factorization over finite fields, Über die mathematischen Grundlagen einiger Chiffrierverfahren, On computing logarithms over GF(2**p), Smoothness and factoring polynomials over finite fields, Cryptology: The mathematics of secure communication, The Pohlig-Hellman method generalized for group structure computation, Elliptic curve cryptosystems and their implementation, An authentication-combined access control scheme using a one-way function, Controlling access in tree hierarchies, A practical anonymous multi-authority e-cash scheme., Unmediated communication in repeated games with imperfect monitoring., A traceable group signature scheme., Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves, A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms, Prime-number algorithm for public-key systems, A practical anonymous payment scheme for electronic commerce, Fast generation of prime numbers and secure public-key cryptographic parameters., Complexity of a determinate algorithm for the discrete logarithm, A novel ID-based group signature, One-way permutations on elliptic curves, A conference key distribution system based on cross-product, A low-memory algorithm for point counting on Picard curves, The GN-authenticated key agreement, Several security schemes constructed using ECC-based self-certified public key cryptosystems, On random walks for Pollard's rho method, A new password authentication mechanism based on two phases encryption, Computing Logarithms in Finite Fields of Characteristic Two, A double large prime variation for small genus hyperelliptic index calculus, Security analysis of discrete logarithm based cryptosystems, Efficient Finite Fields in the Maxima Computer Algebra System, An Identity-Based Key Agreement Protocol for the Network Layer, Bug Attacks, ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message, Speeding Up the Pollard Rho Method on Prime Fields, Polylogarithmic two-round argument systems, Critical remarks on some public-key cryptosystems, An algorithm for evaluation of discrete logarithms in some nonprime finite fields