On hardware-oriented message authentication with applications towards RFID

Proceedings - 2011 Workshop on Lightweight Security and Privacy: Devices, Protocols, and Applications, LightSec 2011

Volumn , Issue , 2011, Pages 26-33

  Ågren, Martin ^a   Hell, Martin ^a   Johansson, Thomas ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Message Authentication Codes; RFID; Universal Hash Functions

Indexed keywords

LIGHT-WEIGHT CONSTRUCTIONS; MESSAGE AUTHENTICATION; MESSAGE AUTHENTICATION CODES; RFID; SAMPLE SPACE; THEORETICAL RESULT; TOEPLITZ MATRICES; UNIVERSAL HASH FUNCTION; UNIVERSAL HASH FUNCTIONS;

AUTHENTICATION; HASH FUNCTIONS; MATRIX ALGEBRA;

RADIO FREQUENCY IDENTIFICATION (RFID);

EID: 79955919703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LightSec.2011.9     Document Type: Conference Paper

References (23)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple construction of almost k-wise independent random variables. Annual IEEE Symposium on Foundations of Computer Science, pages 544-553, 1990.
2. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology - CRYPTO'96, pages 1-15. Springer-Verlag, 1996.
3. O. Billet, J. Etrog, and H. Gilbert. Lightweight privacy preserving authentication for RFID using a stream cipher. In S. Hong and T. Iwata, editors, Fast Software Encryption 2010, volume 6147 of Lecture Notes in Computer Science, pages 55-78. Springer-Verlag, 2010.
4. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. In Advances in Cryptology - CRYPTO'99, pages 215-233. Springer-Verlag, 1999.
5. C. De Cannière and B. Preneel. Trivium. In M. Robshaw and O. Billet, editors, New Stream Cipher Designs, volume 4986 of Lecture Notes in Computer Science, pages 244-266. Springer-Verlag, 2008.
6. A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory, 44:367-378, 1998. (Pubitemid 128737912)
7. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane. Codes which detect deception. Bell Systems Technical Journal, 53(3):405-424, 1974.
8. J. D. Golić. Computation of low-weight parity-check polynomials. Electronic Letters, 32(21):1981-1982, October 1996.
9. H. Handschuh and B. Preneel. Key-recovery attacks on universal hash function based MAC algorithms. In D. Wagner, editor, Advances in Cryptology - CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 144-161. Springer-Verlag, 2008.
10. M. Hell, T. Johansson, A. Maximov, and W. Meier. A Stream Cipher Proposal: Grain-128. In International Symposium on Information Theory-ISIT 2006. IEEE, 2006.
11. M. Hell, T. Johansson, and W. Meier. Grain - a stream cipher for constrained environments. International Journal of Wireless and Mobile Computing, Special Issue on Security of Computer Network and Mobile Systems., 2(1):86-93, 2006.
12. T. Johansson, G. Kabatianskii, and B. Smeets. On the relation between A-codes and codes correcting independent errors. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT'93, volume 765 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 1994.
13. H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology - CRYPTO'94, pages 129-139. Springer-Verlag, 1994.
14. H. Krawczyk. New hash functions for message authentication. In Advances in Cryptology - EUROCRYPT'95, pages 301-310. Springer-Verlag, 1995.
15. E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. SIAM Journal on Computing, 22(6):1331-1348, 1993.
16. M. Matsui. Linear cryptanalysis method for DES cipher. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT'93, volume 765 of Lecture Notes in Computer Science, pages 386-397. Springer-Verlag, 1994.
17. W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1(3):159-176, 1989.
18. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, 1993. (Pubitemid 23677151)
19. W.T. Penzhorn and G.J. Kühn. Computation of low-weight parity checks for correlation attacks on stream ciphers. In C. Boyd, editor, Cryptography and Coding - 5th IMA Conference, volume 1025 of Lecture Notes in Computer Science, pages 74-83. Springer-Verlag, 1995.
20. G. J. Simmons. A survey of information authentication. In G. J. Simmons, editor, Contemporary Cryptology, The Science of Information Integrity, pages 379-419. IEEE Press, 1992.
21. D. R. Stinson. Universal hashing and authentication codes. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO'91, volume 576 of Lecture Notes in Computer Science, pages 74-85. Springer-Verlag, 1992.
22. D. Wagner. A generalized birthday problem. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 288-303. Springer-Verlag, 2002.
23. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265-279, 1981. (Pubitemid 12444638)