Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions

@article{Iwata2018UniversalFA,
  title={Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions},
  author={Tetsu Iwata and Virginie Lallemand and Gregor Leander and Yu F Sasaki},
  journal={IACR Cryptology ePrint Archive},
  year={2018},
  volume={2018},
  pages={793}
}
This article presents universal forgery and multiple forgeries against MergeMAC that has been recently proposed to fit scenarios where bandwidth is limited and where strict time constraints apply. MergeMAC divides an input message into two parts, m‖m̃, and its tag is computed by F(P1(m) ⊕ P2(m̃)), where P1 and P2 are PRFs and F is a public function. The tag size is 64 bits. The designers claim 64-bit security and imply a risk of accepting beyond-birthday-bound queries. This paper first shows… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Similar Papers

Loading similar papers…