Homework on Hash Functions - Questions
- Describe hash functions with your own words hash function is basically like a “unique function” but more secure in a sence meaning once you create your own special word you will have a unique digital fingerprint asigned to it and its un reversible the input and output stays the same and in other words the only way of breaking that binary code is by basically switching a word that phrase but that would not make it the same hash function a hash function is known to be secured special function
- How are hash functions used in cryptocurrencies like bitcoin? (Try to research this on your own, we will cover this later in the course but challenge yourself and see if you can find information on this already now). Bitcoin uses SHA-256 and RIPEMD160 whereas Ethereum uses the Keccak-256 hash function. They are primarily used for generating public keys and block hashing . Block hashing is a core concept of Bitcoin mining.
- What does it mean when we say that hash functions need to be collision resistant? (We didn’t use the term “collision resistant” in the lecture, but you will easily find this on Google, we add this question intentionally to make you research information on your own, that’s how you learn best). In cryptography, collision resistance is a property of cryptographic hash functions: a hash function H is collision-resistant if it is hard to find two inputs that hash to the same output ; that is, two inputs a and b where a ≠ b but H(a) = H(b).