• DocumentCode
    885323
  • Title

    Discrete logarithm hash function that is collision free and one way

  • Author

    Gibson, J.K.

  • Author_Institution
    Dept. of Comput. Sci., Birbeck Coll., London, UK
  • Volume
    138
  • Issue
    6
  • fYear
    1991
  • fDate
    11/1/1991 12:00:00 AM
  • Firstpage
    407
  • Lastpage
    410
  • Abstract
    For suitable composite modulus n and suitable base a, the discrete logarithm hash function x to ax mod n is collision free and one way if factoring n is hard. Further results on the relation between the discrete logarithm problem and factoring are given. Some complexity theory issues are considered.
  • Keywords
    computational complexity; cryptography; number theory; complexity theory; discrete logarithm; hash function;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    105104
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=885323