1.- Explain what does the resistance to collision mean? And what does resistance to preimage mean?

2.- Use tronscan and etherscan to verify the hash of the last block and the hash of the latest transaction. Screenshot is required for checking.

3.- Generate the hash using SHA-256 , from the word CryptoAcademy and from cryptoacademy. Screenshot required. Do you see any difference between the two words? Explain.

4.- In your own words explain the difference between hash and cryptography.

_______________________________

1. Explain what does the resistance to collision mean? And what does resistance to preimage mean?

_______________________________

In order to tackle what resistance to collision means as well as what resistance to pre-image means we need to know that these two terms are used with hash functions.

What is Hash?

A hush is a function or algorithm that maps data by converting an input length into an encrypted output length. It is a one-way function and is therefore practically impossible to invite or reverse its computation.

Hashing algorithms are used to write new transactions into the blockchain through the mining processes there by validating the authenticity and integrity of various types of input. It's useful in a sense that it is widely used to avoid keeping long and plain texts as passwords on the blockchain.

1a) Resistance to Collision

Resistance to collision is a property of the hashtag function that is impractical to 'break even' or where it is impossible to find two colliding inputs with the same hash value.

Resistance to collusion or simply collision resistance (CR) is an important factor when basing on hash functions to to map to input to two different values. It's a security function of cryptographic hash properties, where a weak collision resistance means that the probability of failing to find a collision is not too small to be ignored and therefore minimally possible and a strong CR the probability is almost impossible.

Values X and Y are impossible to find, where XxY, H(x)=H(y)

b) Resistance to Preimage

When a property of a hash function is computationally difficult or impossible to find an input that maps to that element, it is known as Preimage Resistance. Pre-image resistance usually will cause that the output value repeats itself thereby enabling the hash function to ensure that it is uniformly distributed.

For a hush function to be pre-image resistant the length of its result should at least be 80 b i t s.

______________________________

2. Use tronscan and etherscan to verify the hash of the last block and the hash of latest transaction. Screenshot is required for checking.

_______________________________

Verifying Hash with Tronscan.

I go to https://tronscan.org to see the latest mined block for TRON.

After accessing the home page, I click on the latest block and see the hash of the block.

Verifying Hash with Etherscan.

To verify Hash using Etherscan, I go to https://etherscan.io and click home, look for the latest block.

After identifying the latest block I go to the block by clicking on it, and there I can access all the information including it's hash.

_______________________________

3.-Generate the hash using SHA-256 , from the word CryptoAcademy and from cryptoacademy. Screenshot required. Do you see any difference between the two words? Explain.

_______________________________

Using the password generator at https://passwordsgenerator.net/sha256-hash-generator/, I will generate the hash SHA-256 from the word CryptoAcademy and cryptoacademy.

Using CryproAcademy I got this hash;

Using cryptoacademy I got this hash

There is a difference in the hashing codes because the first word 'CryptoAcademy' has got an alfa upper case letter as well as another mid upper case letter whilst the second word 'cryptoacademy' has only lower case letters.

The hash algorithm gave two different hash because two different words can't get the same hash function or code (Resistance to Collision).

_______________________________

4. In your own words explain the difference between hash and cryptography.

_______________________________

• A hush is a function or algorithm that maps data by converting an input length into an encrypted output length. It is a one-way function and is therefore practically impossible to invite or reverse its computation.

Cryptographic protocols protect sensitive data transfers or transactions. The developers of cryptocurrencies built strong cryptography through advanced mathematics and engineering computer principles, that is impossible to break meaning that they cannot be counterfeited or duplicated.

• Cryptography therefore is encrypting of sensitive data transfers or transactions through advanced engineering and maths principles so that they cannot be accessed or altered by a third party.

Notable Differences

HASH	CRYPTOGRAPHY
Data is infeasible or cannot be inverted	With the accepted keys, access can be granted.
Length should atleast be 80bits	Length grows with more info.
Doesn't need keys to function	Uses public or private keys.
Converts input to output	Encrypts all input.

Both are high level security protocols that are used on the Blockchain and both support each other.

Conclusion

In this lesson, i have learnt about Hash and Cryptography. I was able to verify the hash of the last block and the hash of the latest transaction using Tronscan and Etherscan, as well as generating Hash for the two stated words, realizing the difference in the two Hash codes. Thank you professor @pelon53 for the lesson well taught. I submit.