SHA-256 Algorithm Overview

What is the primary goal of the SHA-256 algorithm?

What is the typical output size of the SHA-256 hash function?

Which property ensures that SHA-256 is resistant to collision attacks?

What term describes the characteristic of SHA-256 where it's infeasible to find an input that produces a specific output?

What is the purpose of the padding process in SHA-256?

What type of operations are heavily used within the SHA-256 compression function?

Which of the following is NOT a typical application of SHA-256?

What is the role of 'initialization vector' (IV) in SHA-256?

Which security property of SHA-256 ensures that it's hard to find two different messages that produce the same hash output?

In SHA-256, how many rounds are performed in the compression function?

What is the purpose of 'message schedule' in SHA-256?

Which of these applications is SHA-256 commonly used for?

What happens to the output of SHA-256 if the input message is changed, even slightly?

In the context of cryptography, what does 'salt' refer to when used with SHA-256 for password storage?

What is the size of each word processed in the SHA-256 algorithm?

What is the main reason for using SHA-256 over simpler hash functions like MD5?

Which component of SHA-256 is responsible for mixing the input data with the current hash value?

What is the 'domain separation' problem that SHA-256 helps to solve?

Which of the following is a characteristic of a good cryptographic hash function like SHA-256?

Before hashing, what preprocessing step is applied to the message in SHA-256?