A tight bound for exhaustive key search attacks against Message Authentication Codes

Author: de SÁ Vinícius G.P.   Boccardo Davidson R.   Rust Luiz Fernando   Machado Raphael C.S.  

Publisher: Edp Sciences

E-ISSN: 1290-385x|47|2|171-180

ISSN: 0988-3754

Source: RAIRO - Theoretical Informatics and Applications, Vol.47, Iss.2, 2013-05, pp. : 171-180

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract