Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Taher El Gamal

dblp:71/4376 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 first-authorTheory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 84% Cryptographic protocols and secure computation · 16%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
discrete logarithm		 0.051985
A subexponential-time algorithm for computing discrete logarithms over GF(p2) · IEEE Trans. Inf. Theory 1985
A public key cryptosystem and a signature scheme based on discrete logarithms · IEEE Trans. Inf. Theory 1985
On Computing Logarithms Over Finite Fields · CRYPTO 1985
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures		 0.021985
A public key cryptosystem and a signature scheme based on discrete logarithms · IEEE Trans. Inf. Theory 1985
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms · CRYPTO 1984
Cryptographic primitives and cryptanalysis
finite field		 0.021985
On Computing Logarithms Over Finite Fields · CRYPTO 1985
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²) · CRYPTO 1983
Cryptographic protocols and secure computation › key exchange
diffie-hellman key exchange		 0.011985
A public key cryptosystem and a signature scheme based on discrete logarithms · IEEE Trans. Inf. Theory 1985
Cryptographic protocols and secure computation
key exchange		 0.011985
A public key cryptosystem and a signature scheme based on discrete logarithms · IEEE Trans. Inf. Theory 1985
Cryptographic primitives and cryptanalysis
public-key cryptography		 0.011985
A public key cryptosystem and a signature scheme based on discrete logarithms · IEEE Trans. Inf. Theory 1985
Algorithms and data structures
number-theoretic algorithms		 0.011985
A subexponential-time algorithm for computing discrete logarithms over GF(p2) · IEEE Trans. Inf. Theory 1985
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption		 0.011984
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms · CRYPTO 1984

Methods — techniques the papers use, named apart from their topics

virtual spanning set · 0.0quadratic fields · 0.0index calculus · 0.0discrete logarithm problem · 0.0
YearPublicationVenuePosition
1985 On Computing Logarithms Over Finite Fields
Taher El Gamal
 CRYPTO1
1985 A public key cryptosystem and a signature scheme based on discrete logarithms
abstract
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Taher El Gamal
 IEEE Trans. Inf. Theory1
1985 A subexponential-time algorithm for computing discrete logarithms over GF(p2)
abstract
An algorithm for computing discrete logarithms over GF(p^{2}), wherepis a prime, in subexponential time is described. The algorithm is similar to the Merkle-Adleman algorithm for computing logarithms over GF(p), but it uses quadratic fields as the appropriate algebraic structure. It also makes use of the idea of a virtual spanning set due to Hellman and Reyneri for computing discrete logarithms over GF(p^{m}), formgrowing andpfixed.
Taher El Gamal
 IEEE Trans. Inf. Theory1
1984 A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Taher El Gamal
 CRYPTO1
1983 A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²)
Taher El Gamal
 CRYPTO1