x509.wiki
  • Welcome to X.509
    • Future Topics
  • Important Data Formats
    • X.509
    • PKCS#7
    • PKCS#10
    • PKCS#12
    • ASN.1 and PEM
  • Enrollment Methods
    • SCEP
    • Microsoft RPC/DCOM
  • Cryptography
    • Hashing Algorithms
    • Asymmetric Cryptography
  • Public Key Infrastructure
    • Establishing Trust
  • Use Cases for Certificates
    • Transport Layer Security (TLS)
  • Other Stuff
    • How Many Tiers Should a PKI Have?
    • Certifried and Similar Attacks
    • Certificate Lifecycle Management
  • Useful links
    • Peter Gutmann
Powered by GitBook

Section

  • Imprint

Content under XXX Licence 2024

On this page
  • What is a Collision?
  • What is a MAC?
  • How is a MAC different from an HMAC?

Was this helpful?

Edit on GitHub
Export as PDF
  1. Cryptography

Hashing Algorithms

A hashing algorithm is a mathematical function that converts input data of any size into a fixed-length string of characters, which is typically a sequence of letters and numbers. This output is known as a hash value or digest.

What is a Collision?

A collision in hashing occurs when two distinct pieces of data produce the same hash value using a hashing algorithm12. This can be problematic because the primary goal of a hashing algorithm is to uniquely represent different data inputs.

What is a MAC?

Message Authentication Code (MAC): In cryptography, a MAC is a short piece of information used to authenticate a message and ensure its integrity. It verifies that the message has not been altered and confirms the sender’s identity.

How is a MAC different from an HMAC?

MAC: A general term for a code that verifies message integrity and authenticity, using either block ciphers or hash functions.

HMAC: A specific type of MAC that uses a cryptographic hash function and a secret key, offering stronger security properties.

PreviousCryptographyNextAsymmetric Cryptography

Last updated 9 months ago

Was this helpful?