benchmarks.wiki / Public workspace

MMLU / Let I = (S,V)I=(S,V) be a MAC. Suppose S(k,m)S(k,m) is always 5 bits long. Can…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Let I = (S,V)I=(S,V) be a MAC. Suppose S(k,m)S(k,m) is always 5 bits long. Can this MAC be secure?

choices

  1. No, an attacker can simply guess the tag for messages
  2. It depends on the details of the MAC
  3. Yes, the attacker cannot generate a valid tag for any message
  4. Yes, the PRG is pseudorandom

subject

computer_security

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import