Hello Everyone!

This is Sami Zuberi , hope you all are well. I am exceptionally hope set aside a few minutes for perusing my homework post for @pelon53 and valued it. Here i am going to impart my views on " Hash and Cryptography". So how about we begin.

Question 1.

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

Resistance to Collision :

Collision resistance is a feature of cryptographic algorithms, a hash function is collision resistant if finding two inputs that hash to a certain output is difficult that is finding two inputs a and b. Collisions are unavoidable throughout every hash function with far more inputs than outputs. Collision is a reaction in which different different inputs provide the same outcome. It is practically difficult to identify two clashing inputs while using Resistance to Collision. Collision resistance is beneficial for a range of factors in which one is ; Users offer hash collisions as evidence that they would have completed a specific number of calculations to locate them in various proof-of-work systems. Individuals can trick the system if there is a simpler method to discover collisions beyond overwhelming force.

Resistance to Preimage :

Preimage resistance is the feature of a hash function that it would be difficult to inversion; such that, for a component in the domain of a hash function, finding an input that corresponds to that component should be virtually impossible. A single side/way function seems to be another term for the pre-image resistance function, which means that it is unlikely for a turnaround reaction to continue with that same hash function. Preimage resistance contains a customized output.

Question 2.

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

Tronscan to verify the hash of the last block and the hash of that transaction

You should go to https://tronscan.org. in order to see the most recent block hash and transaction hash. And click on "All Filters".

Then after clicked on the All filters, We clicked on blocks.

Then we got an interface of transacted blocks.

After that I picked a random block, then clicked it and successfully got the details of that block. Details contain the height of block hash of block and so on.

And after that we go to the transactions option which is next to block option in screenshot 3 and then the page containing the transactions of blocks appear then we clicked on any random block and then got the overview of that.

Etherscan to verify the hash of the last block and the hash of that transaction.

To check etherscan's most recent block hash and transaction hash, go to https://etherscan.io .

Then scroll down the page and then go to the latest blocks portion and here picked any random block.

Then clicked on the block that you picked so the details of that block will appear on screen.

Then we go to the transaction then the page will appear that contain transaction lists of transaction addresses.

After select any random transaction address it will open a page that contains the details of transactions.

Question 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.

When i going to generate the hash using SHA-256 from the two words which is CryptoAcademy and cryptoacademy, the hash appeared for CryptoAcademy is :

D03CA34B258E6E0FD06B2070DDE61B50BD4EEF6161A8EDAA4A420C9AE1BEB7F9

When I used SHA256 to look up cryptoacademy's hash, the result was ;

0592F5DD27DC72E675B2AB9C77487A69FAAF84196597FA052EC099C18EE7C4C5

As seen in the pictures above, I discovered both hashes to be distinct since each words had different cases. This demonstrates that Hash is resistant to collision.

Question 4.

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

HASH.

In layman's terms, hashing is the process of accepting any size input and returning a fixed length output. Hashes are permanent and may be used to convert information. Hashing is the way of forming and converting any length of input data into a stabilized string using a specified algorithm.

Cryptography.

Cryptography is a way of using codes to safeguard information and interactions so only to those who are supposed to read and process it may do so. Cryptography is crucial because it allows you to securely safeguard data that you don't want others to have access to. It's utilized to safeguard company secrets, confidential information, and personal information.

Difference between the hash & cryptography.

Hash	Cryptograpy
Hashing is used to safeguard the credibility of the data.	Cryptography is used to protect the data from third parties..
There are different hashing algorithms.	In cryptography there are different types of cryptography.
The objective of hashing is to classify and extract data.	Cryptography includes converting, in able to preserve it hidden from others.
The hashed data is usually short and constant in length.	The length of the cryptographic data is not defined.
There seem to be no keys essential for hashing.	To recover information, cryptography requires keys.

Conclusion.

I conclude that professor gave us a very informative lecture that helps to know about the hash and hashing functions and cryptography. A hash function is a key element that plays a significant role in the crypto industry. They both have their own importance. They're both used to encrypt data for security purposes. Hash gives several perks to the network, which are accumulated on a frequent basis. The primary essential characteristics an of hash are resistance, preimage and collision.

Special mentions to;
@pelon53