Cryptographic Hash Function
Cryptography
1 references
A function that maps arbitrary data to a fixed-size digest. Good hash functions are preimage-resistant, second-preimage-resistant, and collision-resistant.
Appears in 1 whitepaper sections
Related Stories
Origin Story
Monero's Origin: The CryptoNote Revolution and the Fight for Financial Privacy
How an anonymous whitepaper by 'Nicolas van Saberhagen' led to a community fork that created the gold standard of priva…
Technical ExplainerMerkle Trees: The Data Structure That Makes Blockchains Possible
How hash trees enable efficient verification of massive datasets, from Bitcoin's SPV to Ethereum's state tries and beyo…
ComparisonPrivacy in Crypto: Bitcoin's Pseudonymity vs Monero's Anonymity
Comparing Bitcoin's transparent ledger with Monero's ring signatures and stealth addresses — the spectrum of financial …