Hash Function Encryption Algorithm

A Hash Function Encryption Algorithm is a Data Cryptographic Algorithm that uses a fixed length hash value instead of using a key.

• AKA: Message Digest, One-Way Encryption Algorithm, Hash Encryption Algorithm.
• Context:
  • It can be implemented by a Hash Function Encryption System to solve a Hash Function Encryption Task.
• Example(s):
  • Message Digest (MD) Algorithm,
  • Secure Hash Algorithm (SHA),
  • ...
• Counter-Example(s):
  • Public Key Cryptography (PKC) Algorithm,
  • Secret Key Cryptography (SKC) Algorithm.
• See: Hash Function, SSH, Data Transformation Algorithm, Public Key Infrastructure (PKI), Cryptosystem, Cold Boot Attack, Cyberspace Electronic Security Act, Geoblocking, Data Erasure, Information Security, Decentralized Online Social Network.

References

2021

• (Kessler, 2021) ⇒ Gary C. Kessler (2021)."3.3. Hash Functions". In: "An Overview of Cryptography".
  • QUOTE: Hash functions, also called message digests and one-way encryption, are algorithms that, in essence, use no key (...). Instead, a fixed-length hash value is computed based upon the plaintext that makes it impossible for either the contents or length of the plaintext to be recovered. Hash algorithms are typically used to provide a digital fingerprint of a file's contents, often used to ensure that the file has not been altered by an intruder or virus. Hash functions are also commonly employed by many operating systems to encrypt passwords. Hash functions, then, provide a mechanism to ensure the integrity of a file.

• Concept
• Data Science