摘要: We present a new message authentication code (MAC) called the cyclic redundancy check-noise-tolerant (CRC-NTMAC). The CRC-NTMAC improves upon recently developed NTMAC. Unlike conventional MACs, such as keyed-hash MAC (HMAC), and NTMAC tolerate modest number of errors, might be caused by noisy communications channel. Furthermore, both MACs provide estimates locations errors. CRC-NTMAC, however, provides better has lower false acceptance probability. is also not based on cryptographic hash functions
sci-hub.se 参考文章(7)
W. Peterson, D. Brown, Cyclic Codes for Error Detection Proceedings of the IRE. ,vol. 49, pp. 228- 235 ,(1961) , 10.1109/JRPROC.1961.287814
Mihir Bellare, Moti Yung, Certifying Permutations: Noninteractive zero-knowledge based on any trapdoor permutation Journal of Cryptology. ,vol. 9, pp. 149- 166 ,(1996) , 10.1007/BF00208000
C.G. Boncelet, The NTMAC for authentication of noisy messages IEEE Transactions on Information Forensics and Security. ,vol. 1, pp. 35- 42 ,(2006) , 10.1109/TIFS.2005.863506
Mihir Bellare, Ran Canetti, Hugo Krawczyk, Keying Hash Functions for Message Authentication international cryptology conference. pp. 1- 15 ,(1996) , 10.1007/3-540-68697-5_1
Xuejia Lai, Xiaoyun Wang, Hongbo Yu, Dengguo Feng, Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD IACR Cryptology ePrint Archive. ,vol. 2004, pp. 199- ,(2004)
Terry Ritter, The great CRC mystery Dr. Dobb's Journal archive. ,vol. 11, pp. 26- 34 ,(1986)
Rivest, The MD5 Message-Digest Algorithm RFC1321. ,(1992)