INS2

What is a Birthday Attack?

• An attack exploiting the properties of birthday parties

• A brute-force attack to find two inputs with the same hash

• An attack on RSA encryption

• A denial-of-service (DoS) attack

The Birthday Attack exploits which cryptographic weakness?

• Weak encryption keys

• Hash collisions

• Slow processing speed

• Public key exposure

Why is the Birthday Attack considered efficient compared to a full brute-force attack?

• It finds hash collisions faster due to probability theory

• It only requires knowledge of the private key

• It does not require computational resources

• It works only on small hash functions

What is the probability that two people in a room of 23 people share the same birthday?

• Around 10%

• Around 25%

• Around 50%

• Around 90%

The Birthday Attack is particularly useful in attacking which type of digital security mechanism?

• Symmetric encryption

• Digital signatures

• Firewalls

• VPNs

What is a real-world example of a Birthday Attack?

• Cracking a password using brute force

• Finding two documents with different content but the same hash

• Sending fake emails with forged sender addresses

• Hacking into a database using SQL injection

Who developed the Tiger hash function?

• Ronald Rivest

• Ross Anderson and Eli Biham

• Whitfield Diffie and Martin Hellman

• Bruce Schneier

What is the default output size of the Tiger hash function?

• 128 bits

• 192 bits

• 256 bits

• 512 bits

Which type of operations does the Tiger hash function heavily rely on for efficiency?

• Modular exponentiation

• XOR and bitwise shifts

• Multiplication and bitwise rotations

• Prime number factorization

Which of the following cryptographic hash functions was designed for 64-bit platforms?

• MD5

• SHA-1

• Tiger

• Whirlpool