The Wayback Machine - https://web.archive.org/web/20080307221118/http://citeseer.ist.psu.edu:80/context/11768/0
168 citations found. Retrieving documents...
Stephen C. Pohlig and Martin E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic signicance. IEEE Transactions on Information Theory, 24:106110, 1978.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50
On Diffie-Hellman Key Agreement with Short Exponents - van Oorschot, Wiener (1996)   (13 citations)  Self-citation (Hellman)   (Correct)

No context found.

S.C. Pohlig, M.E. Hellman, "An improved algorithm for computing logarithms over GF (p) and its cryptographic significance", IEEE Trans. Information Theory, vol. IT-24, no.1 (Jan. 1978), pp.106-110.

The Pohlig-Hellman Method Generalized for Group Structure.. - Teske   Self-citation (Pohlig Hellman)   (Correct)

No context found.

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance, IEEE-Transactions on Information Theory 24 (1978), 106--110.

On the Security of Generalized Jacobian Cryptosystems - Dechene (2006)   (Correct)

No context found.

Stephen C. Pohlig and Martin E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic signicance. IEEE Transactions on Information Theory, 24:106110, 1978.

General Secret Sharing Based on the Chinese - Remainder Theorem Sorin (2006)   (Correct)

No context found.

S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106--110, 1978.

Blinded Fault Resistant Exponentiation - Guillaume Fumaroli And (2006)   (Correct)

No context found.

Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory 24 (1978) 106--110

Discrete Logarithms In Generalized Jacobians - Galbraith, Smith (2006)   (Correct)

No context found.

G. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE Trans. Info. Theory 24 (1978), 106--110.

A New Public-Key Cryptosystem Based on Higher Residues - Naccache, Stern (1998)   (23 citations)  (Correct)

No context found.

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance IEEE Transactions on Information Theory, vol. IT-24-1, pp. 106--110, 1978. David Naccache and Jacques Stern

Revisiting Oblivious Signature-Based Envelopes - Samad Nasserian And (2005)   (Correct)

No context found.

S. Pohlig and M. Hellman, An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance, IEEE Transactions on Information Theory, Vol. 24 pp. 106-110, January 1978.

A New Public-Key Cryptosystem Based on - Higher Residues Published   (Correct)

No context found.

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance IEEE Transactions on Information Theory, vol. IT-24-1, pp. 106--110, 1978. David Naccache and Jacques Stern

Compartmented Secret Sharing Based on the Chinese - Sorin Iftene Faculty (2005)   (Correct)

No context found.

S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106--110, 1978.

Authentication and Authenticated Key Exchanges - Diffie, van Oorschot, Wiener (1992)   (80 citations)  (Correct)

No context found.

S.C. Pohlig and M. Hellman, "An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance", IEEE Transactions on Information Theory IT-24 (1978), 106-110.

Analysis of the GHS Weil Descent Attack on the ECDLP over .. - Maurer, Menezes, Teske (2001)   (3 citations)  (Correct)

No context found.

S. Pohlig and M. Hellman, \An improved algorithm for computing logarithms over GF (p) and its cryptographic signi cance", IEEE Transactions on Information Theory, 24 (1978), 106-110.

SPA resistant left-to-right integer recodings - Theriault (2005)   (Correct)

No context found.

S.C. Pohlig and M.E. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Trans. Information Theory, 24(1):106--110, 1978.

Speeding up Pollard's Rho Method for Computing Discrete Logarithms - Teske (1998)   (20 citations)  (Correct)

No context found.

S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE-Transactions on Information Theory, 24:106--110, 1978.

Computing Discrete Logarithms with the General Number Field Sieve - Weber (1996)   (3 citations)  (Correct)

No context found.

S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on Inform. Theory 24, 106-- 110, 1978

An Implementation of the General Number Field Sieve to Compute.. - Weber (1994)   (3 citations)  (Correct)

No context found.

S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on Inform. Theory 24, 106-- 110, 1978

Dependable Coding of Fiducial Tags - Andrew Rice Laboratory   (Correct)

No context found.

S. Pholig and M. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24(1):106--110, January 1978. 9

Constructing Nonresidues in Finite Fields and the Extended.. - Buchmann, Shoup (1990)   (2 citations)  (Correct)

No context found.

S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory, 24:106--110, 1978.

Privacy-Enhanced Searches Using Encrypted Bloom Filters - Bellovin, Cheswick (2004)   (3 citations)  (Correct)

No context found.

Stephen C. Pohlig and Martin Hellman, "An improved algorithm for computing logarithms over GF (p) and its cryptographic significance," IEEE Transactions on Information Theory, vol. IT-24, pp. 106--110, 1978.

Privacy-Enhanced Searches Using Encrypted Bloom Filters - Steven Bellovin Smb (2004)   (3 citations)  (Correct)

No context found.

Stephen C. Pohlig and Martin Hellman, "An improved algorithm for computing logarithms over GF (p) and its cryptographic significance," IEEE Transactions on Information Theory, vol. IT-24, pp. 106--110, 1978.

Assumptions Related to Discrete Logarithms: Why Subtleties.. - Sadeghi, Steiner (2001)   (10 citations)  (Correct)

No context found.

S.C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106--110, 1978. 253

A New Public-Key Cryptosystem - Published In Fumy   (Correct)

No context found.

S. Pohlig & M. Hellman, An improved algorithm for computing logarithms over GF(q) and its cryptographic significance, IEEE Transactions on Information Theory, vol. 24, pp. 106--110, 1978.

A New Public-Key Cryptosystem Based on Higher Residues - Naccache, Stern (1998)   (23 citations)  (Correct)

No context found.

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance IEEE Transactions on Information Theory, vol. IT-24-1, pp. 106--110, 1978. David Naccache and Jacques Stern

A Survey of Public-Key Cryptosystems - Koblitz, Menezes   (Correct)

No context found.

S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF (p) and its cryptographic significance, IEEE Transactions on Information Theory, 24 (1978), pp. 106-110.

A New Public-Key Cryptosystem - Naccache, Stern (1997)   (14 citations)  (Correct)

No context found.

S. Pohlig & M. Hellman, An improved algorithm for computing logarithms over GF(q) and its cryptographic significance, IEEE Transactions on Information Theory, vol. 24, pp. 106--110, 1978.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC