# Cryptographic Hash and Integrity Protection Quiz Answers

## Get All Week Cryptographic Hash and Integrity Protection Quiz Answers

### Cryptographic Hash and Integrity Protection Week 01 Quiz Answers

#### Quiz 1: Cryptographic Hash Function

Q1. Which of the following statements are false for hash functions?

• The input size can vary.
• Across varying inputs, the output of the hash function needs to be uniformly distributed.
• Given an input, a hash function can produce multiple outputs
• The output size is fixed.

Q2. Which of the following terms are used to describe the output of the hash function?

• Digest
• Fingerprint
• Hash value
• Cache
• Message

Q3. Which of the following states that for any given input, it is computationally infeasible to find another input that produces the same hash as the given input

• Weak collision resistance
• One-way property
• Pre-image resistance
• Strong collision resistance

Q4. Which of the following statements are true for cryptographic hash function requirements?

• The avalanche effect is a desirable property of the hash function because it prevents attacks that compare the outputs to infer the relations between the corresponding inputs.
• Any hash function that is strong collision resistant is also weak collision resistant.
• Any hash function that is pre-image resistant is also weak collision resistant.
• All practical hash functions need to fulfill the same set of requirements.
• Any hash function that is strong collision resistant is also pre-image resistant.

Q5. When the hash function uses a 1-byte long key, how many computations would it require an attacker to break strong collision resistance?

`16`

Q6. When the hash function uses a 1-byte long key, how many computations would it require an attacker to break weak collision resistance?

`128`

Q7. When the hash function uses a 1-byte long key, how many computations would it require an attacker to break preimage resistance?

`256`

### Cryptographic Hash and Integrity Protection Week 02 Quiz Answers

#### Quiz 2: Hash Chain and Hash Tree

Q1. In hash chain, H^n indicates the output of the n-th hash. Suppose H^3 has an error and its value changed. Which of the values would get affected and change?

• H^2
• The input for the entire hash chain
• H^5
• H^4
• H^3

Q2. The server, acting as the verifier, has the value H^n stored for the verification. What is the one-time password that will be used by the user?

• H^n
• H^{n-1}
• H^2
• x (which is the original input of the hash chain)
• H^{n+1}
• H

Q3. For a hash tree that covers 32 data blocks, how many hash checks do you need to perform to detect the error? Assume that error occurred on only one block.

`32`

Q4. For a hash tree that covers 32 data blocks, how many hash checks do you need to perform to detect the error? Assume that error occurred on two distinct blocks.

32

Q5. For a hash tree that covers 16 data blocks, how many hash checks do you need to perform to localize the error? Assume that error occurred on only one block.

`9`

Q6. For a hash tree that covers 128 data blocks, how many hash checks do you need to perform to localize the error? Assume that error occurred on only one block.

`15`

Q7. Now the error occurred on two distinct blocks. For a hash tree that covers 16 data blocks, how many hash checks do you need to perform to localize the error?

`15`

Q8. Which of the followings are true for hash tree (Merkle tree)? The tree is binary where there are two child nodes for each parent node.

• To construct the hash tree, the hash inputs are twice as long as the hash outputs.
• Merkle root changes only if the majority of the data blocks change.
• Hash tree requires fixed number of data blocks (which are the inputs of the lowest-level hash functions).
• The computational complexity grows linearly as the number of data blocks increases exponentially.

#### Quiz 2: Cryptocurrency and TESLA

Q1. Cryptocurrency, e.g., bitcoin, uses the Merkle tree for efficient verification. Which of the following best describes the data (the input to the hash at the lowest level of the tree hierarchy) in cryptocurrency?

• Central bank’s signature
• Transmission originated from a Bitcoin miner
• The arbiter information
• Cryptocurrency transaction

Q2. Which of the following does the TESLA broadcasting authentication scheme use? Select all that apply.

• Cryptographic hash function
• Hash chain
• Merkle tree

### Cryptographic Hash and Integrity Protection Week 03 Quiz Answers

#### Quiz 1: Message Authentication Code

Q1. Which of the following is true about message authentication?

• Message authentication code (MAC) is based on asymmetric keys.
• Message authentication code (MAC) needs to be reversible.
• Message authentication code (MAC) is based on symmetric keys.
• Symmetric encryption/decryption can provide message authentication.
• Message authentication holds the user accountable for its messages, e.g., the transmitter cannot deny sending the message after it has done so.

Q2. Which of the following terms is not used interchangeably with message authentication code (MAC)?

• Digital signature
• Authenticator
• Tag
• Cryptographic checksum
• Keyed hash

Q3. Which of the following is not a reason to use/prefer MAC over symmetric encryption for message authentication?

• Confidentiality protection
• Application requirement
• Performance
• Flexibility
• Longer protection

Q4. A MAC, such as that based on DAA/DES, uses a 56-bit key and a 64-bit MAC code/tag. How many computations would it require for an attacker to brute-force the MAC on average?

• 2^55
• 2^63
• 2^64
• 2^56
• 2^32
• 2^28

Q5. A MAC, such as that based on DAA/DES, uses a 56-bit key and a 64-bit MAC code/tag. However, now, the key gets updated very frequently; every MAC code that gets produced uses a different key. How many computations would it require for an attacker to brute-force the MAC on average?

• 2^64
• 2^63
• 2^32
• 2^56
• 2^55
• 2^28

Q6. Which of the following is not a security requirement for MAC?

• Independence across bits
• MAC code is uniformly distributed
• Avalanche effect
• Collision resistance
• Large key size

Q7. How is CMAC different from the DAA algorithm? Select all that apply.

• CMAC has options for the block ciphers.
• CMAC additionally uses a derived key (derived from the original key) when generating the MAC code.
• CMAC supports public-key cryptography.
• CMAC provides longer MAC code.

### Cryptographic Hash and Integrity Protection Week 04 Quiz Answers

#### Quiz 1: Digital Signature

Q1. In which of the following threat scenarios, can digital signature be useful (to counter)? Digital signature can also used to ensure time integrity, e.g., protect the integrity of the timestamp.

• Alice transmits a file to Bob. The file contains sensitive information (e.g., hospital records) that is to be protected from disclosure.
• An attacker, who is not authorized to read the file, is able to monitor the transmission and capture a copy of the file during its transmission.
• A network manager, A, transmits a message to a computer, B, under its management. The message instructs computer B to update an authorization file to include the identities of a number of new users who are to be given access to that computer.
• Rather than intercepting a message, an attacker constructs its own message with the desired entries and transmits that message to B as if it had come from manager A. Computer B accepts the message as coming from manager A and updates its authorization file accordingly.
• A network manager, A, transmits a message to a computer, B, under its management. The message instructs computer B to update an authorization file to include the identities of a number of new users who are to be given access to that computer.
• An attacker intercepts the message, alters its contents to add or delete entries, and then forwards the message to B, which accepts the message as coming from manager A and updates its authorization file accordingly.
• A message is sent from a customer to a stockbroker with instructions for various transactions.
• Subsequently, the investments lose value and the customer denies sending the message.
• An employee is fired without warning. The personnel manager sends a message to a server system to invalidate the employee’s account. When the invalidation is accomplished, the server is to post a notice to the employee’s file as confirmation of the action.
• The employee (the attacker) is able to intercept the message and delay it long enough to make final access to the server to retrieve sensitive information. The message is then forwarded, the action taken, and the confirmation posted.

Q2. Which of the following statements are true about digital signatures?

• Digital signature protects the confidentiality of the data
• A digital signature is typically smaller than the data size.
• Digital signature is based on asymmetric/public-key cryptography
• Digital signature is functionally equivalent to message authentication (and is used when symmetric keys are not available)
• Digital signature tends to require more computational resources than message authentication

Q3. Which of the following is not a requirement for digital signatures?

• Uses information unique to the sender
• Verifiable by a trusted third-party
• Difficult to forge
• Depends on the message being signed
• Easy to produce

Q4. For RSA Signature and Digital Signature Standard (DSS), how does the sender generate the digital signature given the message, p?

• Takes the hash of the p and then encrypts using its private key
• Takes the hash of the p and then encrypts using its public key
• Takes p and encrypts it using its private key
• Takes p and encrypts it using its public key
• Takes p and encrypts it using the symmetric key which resulted from the Diffie-Hellman Key Exchange
• Encrypt p using its private key and then take the hash
• Encrypt p using its public key and then take the hash
##### Cryptographic Hash and Integrity Protection Course Review

In our experience, we suggest you enroll in Cryptographic Hash and Integrity Protection courses and gain some new skills from Professionals completely free and we assure you will be worth it.

Cryptographic Hash and Integrity Protection for free, if you are stuck anywhere between a quiz or a graded assessment quiz, just visit Networking Funda to Cryptographic Hash and Integrity Protection Quiz Answers.

##### Get All Course Quiz Answers of Machine Learning Specialization

Cryptography and Information Theory Quiz Answers

Asymmetric Cryptography and Key Management Quiz Answers

Cryptographic Hash and Integrity Protection Quiz Answers

##### Team Networking Funda

Welcome to the official Author Page of Team Networking Funda! Here, we are dedicated to unraveling the intricate world of networking, connectivity, and team dynamics. Our mission is to provide you with insightful, actionable advice and solutions that will help you build strong connections, foster collaboration, and achieve success in all aspects of your professional life.

🌐 Networking Insights: Dive into the art of networking with us, as we explore strategies, tips, and real-world examples that can elevate your networking game. Whether you're a seasoned pro or just starting, we have valuable insights to offer.

🤝 Team Synergy: Discover the secrets to creating high-performing teams. We delve into team dynamics, leadership, and communication to help you unlock the full potential of your team and achieve outstanding results.

🚀 Professional Growth: Explore the tools and techniques that can accelerate your professional growth. From career development to personal branding, we're here to guide you toward achieving your goals.

🌟 Success Stories: Be inspired by success stories, case studies, and interviews with experts who have mastered the art of networking and teamwork. Learn from their experiences and apply their insights to your journey.

💬 Engage and Connect: Join the conversation, leave comments, and share your own networking and team-building experiences. Together, we can create a vibrant community of like-minded professionals dedicated to growth and success.

Stay tuned for a wealth of resources that will empower you to excel in your professional life. We're here to provide you with the knowledge and tools you need to thrive in today's interconnected world.

We are Team Networking Funda, a group of passionate authors and networking enthusiasts committed to sharing our expertise and experiences in the world of networking and team building. With backgrounds in [Your Background or Expertise], we bring a diverse range of perspectives and insights to help you navigate the challenges and opportunities of professional networking and teamwork.

error: Content is protected !!