Stephen C. Pohlig
Martin E. Hellman
- [1].D. E. Knuth, The Art of Computer Programming, Vol. II: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969.Google Scholar
- [2].D. E. Knuth, The Art of Computer Programming, Vol. III: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.Google Scholar
- [3].R. W. Keyes, “Physical limits in digital electronics,” in Proc. IEEE, vol. 63, pp. 740-767, May 1975.Google ScholarCross Ref
- [4].R. W. Landauer, “Irreversibility and heat generation in the computing process,” IBM J. Res. Develop., vol. 5, pp. 183-191, 1961.Google ScholarDigital Library
- [5].M. V. Wilkes, Time-Sharing Computer Systems. New York: American Elsevier, 1968.Google ScholarDigital Library
- [6].A. Evans, W. Kantrowitz, and E. Weiss, “A user authentication scheme not requiring secrecy in the computer,” Comm. ACM, vol. 17, pp. 487-442, Aug. 1974.Google ScholarDigital Library
- [7].G. B. Purdy, “A high security log-in procedure,” Comm. of ACM, vol. 17, pp. 442-445, Aug. 1974.Google ScholarDigital Library
- [8].R. Merkle, “Secure communication over an insecure channel,” submitted to Comm. of ACM. [Subsequently published as R. Merkle, “Secure Communications over Insecure Channels,” Comm. of ACM, vol. 21, pp. 294-299, Apr. 1978. Available online https://www.merkle.com/1974/PuzzlesAsPublished.pdf.]Google ScholarDigital Library
- [9].W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform Theory, vol. IT-22, pp. 644-654, Nov. 1976. [Now available online http://www-ee.stanford.edu/~hellman/publications/24.pdf.]Google Scholar
- [10].R. A. Scholtz and L. R. Welch, “Generalized residue sequence,” in Proc. Int. Conf. Comm., Seattle, WA, June 1973.Google Scholar
- [11].R. Merkle and M. E. Hellman, “Hiding information and receipts in trap door knapsacks,” presented at 1977 IEEE Int. Symp. Information Theory, Ithaca, NY, Oct. 1977. [Subsequently published as IEEE Trans. on Info. Theory, Vol. IT-24, pp. 525-536, Sep. 1978. http://www-ee.stanford.edu/~hellman/publications/30.pdf.]Google Scholar
- [12].R. G. Archibald, An Introduction to the Theory of Numbers. Columbus, OH: Merrill, 1970.Google Scholar
- [13].Handbook of Mathematical Functions, M. Abramowitz and I. A. Stegun, Eds. New York: Dover, 1965.Google Scholar
- [14].R. L. Rivest, A. Shamir, L. Adleman, “On digital signatures and public-key cryptosystems,” Dep. Elec. Engr. and Comp Sci., M.I.T., Cambridge, MA, Tech. Rep. MIT/LCS/TM-82, Apr. 1977. [Subsequently published in Comm. of ACM, Vol. 21, pp. 120-126, Feb 1978. Now online .]Google ScholarDigital Library
- [15].N. J. A. Sloane, A Handbook of Integer Sequences. New York: Academic, 1973.Google Scholar
Index Terms
- An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance
Index terms have been assigned to the content through auto-classification.
Recommendations
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
A cryptographic system is described which is secure if and only if computing logarithms over GF(p) is infeasible. Previously published algorithms for computing this function require O(p^{1/2}) complexity in both time and space. An improved algorithm is ...
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniquesGiven a primitive element g of a finite field GF(q) , the discrete logarithm of a nonzero element u GF(q) is that integer k , 1 k q -1, for which u = g k . The well-known problem of computing discrete logarithms in finite fields has ...
Factorizations in the elementary Abelian p-group and their cryptographic significance
Let G be a finite group and let A i 1 ≤ i ≤ s , be subsets of G where A i 2, 1 ≤ i ≤ s and s 2. We say that (A1, A2,..., A3) is a factorization of G if and only if for each g G there is exactly one way to express g = a ...
Comments