Skip to main content
SpringerLink
Log in

Analysis of the Herlestam and Johannesson discrete logarithm scheme inGF(2N) for largeN

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The Herlestam and Johannesson algorithm for computing discrete logarithms inGF(2n) requires the precomputation of logarithms for a target set consisting of all field elements of Hamming weight less than some predetermined value. The procedure, both in precomputation and at run-time, selects elements of lowest weight from large sets of elements. These sets are not randomly chosen but their minimum weight statistics parallel those for sets of equal size chosen entirely at random. By analyzing the statistics for randomly chosen sets, we show that the target set must contain all elements up to about weightn/3–8. This is clearly impractical for even moderately large values ofn.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Berkovits, J. Kowalchuk and B. Schanning,Implementing public key schemes, IEEE Comm. Soc. Mag., Vol. 17, No. 3, May 1979, pp. 2–3.

    Google Scholar 

  2. E. R. Berlekamp,Algebraic Coding Theory, McGraw-Hill, New York, New York, 1968.

    Google Scholar 

  3. R. S. Burington,Handbook of Mathematical Tables and Formulas, McGraw-Hill, New York, New York, 1965, page 359.

    Google Scholar 

  4. D. Coppersmith,Fast evaluation of logarithms in fields of characteristic two, Research Report RC-10187, IBM, Yorktown Heights, New York, Oct. 1983.

    Google Scholar 

  5. T. Herlestam and R. Johannesson,On computing logarithms over GF(2p), 1981 IEEE International Symposium on Information Theory, Santa Monica, California, Feb. 1981. (See alsoBIT, Vol. 21, 1981, p. 326.)

  6. A. M. Odlyzko,Discrete logarithms in finite fields and their cryptographic significance, AT&T Bell Laboratories Internal Memorandum, Sept. 1983.

  7. S. C. Pohlig and M. E. Hellman,An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on Info. Th., Vol. IT-24, No. 1, January 1978, pp. 106–110.

    Google Scholar 

  8. M. O. Rabin,Probabilistic algorithms in finite fields, MIT/LCS/TR-213, Laboratory for Computer Science, Massachusetts, January, 1979.

    Google Scholar 

  9. J. E. Sachs and S. Berkovits,Probabilistic analysis and performance modelling of the ‘Swedish’ algorithm and modifications, in Advances in Cryptography: Proceedings of Crypto '83, Plenum Publishing Corp., New York, 1984.

    Google Scholar 

  10. R. Silver,The computation if indices modulo P, WP-07062, The MITRE Corporation, Bedford, Massachusetts, May 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. K-203 The Mitre Corporation, Burlington Road, 01730, Bedford, MA, USA

    Shimshon Berkovits & Joel E. Sachs

  2. Communications System Division, GTE Government Systems Corp., 77 “A” Street, 02194, Needham Heights, MA, USA

    Shimshon Berkovits & Joel E. Sachs

Authors
  1. Shimshon Berkovits
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joel E. Sachs
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by MITRE Corp. IR & D funds.

Dr. Berkovits was on leave from the University of Lowell, Lowell, MA, 01854.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berkovits, S., Sachs, J.E. Analysis of the Herlestam and Johannesson discrete logarithm scheme inGF(2N) for largeN . BIT 25, 420–424 (1985). https://doi.org/10.1007/BF01934386

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934386

Keywords

Search

Navigation