# Cryptographic Hash

Fleeting- Référence externe : https://en.wikipedia.org/wiki/Cryptographic_hash_function

Cryptographic hash function - Wikipedia

A cryptographic hash function (CHF) is a mathematical algorithm that maps data of arbitrary size (often called the “message”) to a bit array of a fixed size (the “hash value”, “hash”, or “message digest”). It is a one-way function, that is, a function which is practically infeasible to invert or reverse the computation.[1] Ideally, the only way to find a message that produces a given hash is to attempt a brute-force search of possible inputs to see if they produce a match, or use a rainbow table of matched hashes.

## Notes pointant ici

- A Memory Encryption Engine Suitable for General Purpose Processors
- git vs blockchain vs merkle tree
- how does sgx protects my data?
- integrity tree
- Intel SGX Explained
- measurement
- Secure Hash Algorithms