Đánh giá chính xác cận an toàn cho mã xác thực LightMAC
Abstract— The message authentication code mode, LightMAC, which was proposed to use in resource-constrained environments by Atul Luykx has security bound independ on message length. The tag length in LightMAC algorithm depend on demand of user’s. However, the security analysis’s Atul [1] directly uses the Dodis’s result [2] which presents for the case that tag length is the block size. In this paper, we first evaluate the security bound of LightMAC when tag length is less than the block size. Then, the dependence on the message length of LightMAC’s security bound is reviewed.
|
REFERENCE
[2]. Dodis, Y. and K. Pietrzak. "Improving the security of MACs via randomized message preprocessing". in International Workshop on Fast Software Encryption, Springer, 2007. [3]. Bellare, M., K. Pietrzak, and P. Rogaway. "Improved security analyses for CBC MACs". in Annual International Cryptology Conference, Springer 2005. [4]. Bellare, M. and P. Rogaway, "Introduction to modern cryptography". Ucsd Cse p. 207, 2005. [5]. Katz, J. and Y. Lindell, "Introduction to modern cryptography". CRC press, 2014. |
Thông tin trích dẫn: Nguyễn Tuấn Anh, "Đánh giá chính xác cận an toàn cho mã xác thực LightMAC", Nghiên cứu khoa học và công nghệ trong lĩnh vực An toàn thông tin, Tạp chí An toàn thông tin, Vol. 07, No. 01, pp. 59-64, 2018.
Nguyễn Tuấn Anh
