Skip to main content
Taylor & Francis Group Logo
    Advanced Search

    Click here to search products using title name,author name and keywords.

    • Login
    • Hi, User  
      • Your Account
      • Logout
      Advanced Search

      Click here to search products using title name,author name and keywords.

      Breadcrumbs Section. Click here to navigate to respective pages.

      Chapter

      Hash Functions and Applications
      loading

      Chapter

      Hash Functions and Applications

      DOI link for Hash Functions and Applications

      Hash Functions and Applications book

      Hash Functions and Applications

      DOI link for Hash Functions and Applications

      Hash Functions and Applications book

      ByJonathan Katz, Yehuda Lindell
      BookIntroduction to Modern Cryptography

      Click here to navigate to parent product.

      Edition 3rd Edition
      First Published 2020
      Imprint Chapman and Hall/CRC
      Pages 39
      eBook ISBN 9781351133036
      Share
      Share

      ABSTRACT

      This chapter looks beyond the problem of secure communication that has occupied, and considers a cryptographic primitive with many applications: cryptographic hash functions. Collision-resistant hash functions have numerous uses, including another approach—standardized as HMAC—for domain extension for message authentication codes. Hash functions can be viewed as lying between the worlds of private- and public-key cryptography. Hash functions have become ubiquitous in cryptography, and they are often used in scenarios that require properties much stronger than collision resistance. Hash functions are simply functions that take inputs of some length and compress them into short, fixed-length outputs. Collision-resistant hash functions are similar in spirit; again, the goal is to avoid collisions. Cryptographic hash functions are designed with the explicit goal of being collision resistant. Using keyed hash functions solves this technical issue since it is impossible to hardcode a collision for every possible key using a reasonable amount of memory.

      T&F logoTaylor & Francis Group logo
      • Policies
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
      • Journals
        • Taylor & Francis Online
        • CogentOA
        • Taylor & Francis Online
        • CogentOA
      • Corporate
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
      • Help & Contact
        • Students/Researchers
        • Librarians/Institutions
        • Students/Researchers
        • Librarians/Institutions
      • Connect with us

      Connect with us

      Registered in England & Wales No. 3099067
      5 Howick Place | London | SW1P 1WG © 2022 Informa UK Limited