Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs

ePrint Report: Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs

Yaobin Shen, François-Xavier Standaert, Lei Wang

At CRYPTO'18, Datta et al. proposed nPolyMAC and proved the security up to 2^{2n/3} authentication queries and 2^{n} verification queries. At EUROCRYPT'19, Dutta et al. proposed CWC+ and showed the security up to 2^{2n/3} queries. At FSE'19, Datta et al. proposed PolyMAC and its key-reduced variant 2k-PolyMAC, and showed the security up to 2^{2n/3} queries. This security bound was then improved by Kim et al. …

attacks authentication beyond crypto eprint report eurocrypt forgery fse macs report security verification wang xavier