An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4329 LNCS, Issue , 2006, Pages 48-62

  Fossorier, Marc P C ^a   Mihaljević, Miodrag J ^b,d   Imai, Hideki ^c,d   Cui, Yang ^e   Matsuura, Kanta ^e  

^a University of Hawaii at Manoa   (United States)

^b MATHEMATICAL INSTITUTE   (Serbia)

^c CHUO UNIVERSITY   (Japan)

^d NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^e INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Cryptanalysis; Fast correlation attacks; HB protocols; LPN problem; RFID authentication

Indexed keywords

AUTHENTICATION; CHROMIUM COMPOUNDS; CRYPTOGRAPHY;

CRYPTANALYSIS; FAST CORRELATION ATTACKS; HB PROTOCOLS; LPN PROBLEM; RFID AUTHENTICATION;

RADIO FREQUENCY IDENTIFICATION (RFID);

EID: 84998808084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11941378_5     Document Type: Conference Paper

References (20)

1. E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg, “On the Inherent Intractability of Certain Coding Problems”, IEEE Trans. Info. Theory, vol. 24, pp. 384-386, 1978.
2. A. Blum, M. Furst, M. Kearns, and R. Lipton, “Cryptographic Primitives Based on Hard Learning Problems”, CRYPTO ’93, Lecture Notes in Computer Science, vol. 773, pp. 278-291, 1994.
3. A. Blum, A. Kalai and H. Wasserman, “Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model”, Journal of the ACM, vol. 50, no. 4, pp. 506-519, July 2003.
4. F. Chabaud, “On the Security of Some Cryptosystems Based on Error-Correcting Codes. EUROCRYT ’94, Lecture Notes in Computer Science, vol. 950, pp. 113-139, 1995.
5. P. Chose, A. Joux and M. Mitton, “Fast Correlation Attacks: An Algorithmic Point of View”, EUROCRYPT2002, Lecture Notes in Computer Science, vol. 2332, pp. 209-221, 2002.
6. N.T. Courtois and W. Meier, “Algebraic attacks on stream ciphers with linear feedback”, EUROCRYPT’2003, Lecture Notes in Computer Science, vol. 2656, pp. 345-359, 2003.
7. N.T. Courtois, “Fast algebraic attacks on stream ciphers with linear feedback”, CRYPTO’2003, Lecture Notes in Computer Science, vol. 2729, pp. 176-194, 2003.
8. M.P.C. Fossorier, M.J. Mihaljević and H. Imai, “A Unified Analysis for the Fast Correlation Attack”, 2005 IEEE Int. Symp. Inform. Theory - ISIT’2005, Adelaide, Australia, Sept. 2005, Proceedings, pp. 2012-2015 (ISBN 0-7803-9151-9).
9. H. Gilbert, M. Robshaw and H. Sibert, “An Active Attack against HB+ a Provably Secure Lightweight Authentication Protocol”, IACR, Cryptology ePrint Archive, Report 2005/237, July 2005. Available at http://eprint.iacr.org/2005/237.
10. N. Hopper and M. Blum, “Secure Human Identification Protocols”, ASIACRYPT 2001, Lecture Notes in Computer Science, vol. 2248, pp. 52-66, 2001.
11. P. Hawkes and G. Rose, “Rewriting variables: the complexity of fast algebraic attacks on stream ciphers”, CRYPTO 2004, Lecture Notes in Computer Science, vol. 3159, pp. 390-406, Aug. 2004.
12. A. Juels and S. Weis, “Authenticating Pervasive Devices with Human Proto-cols”, CRYPTO2005, Lecture Notes in Computer Science, vol. 3621, pp. 293-308, 2005. Updated version available at: http://www.rsasecurity.com/rsalabs/staff/bios/ajuels/publications/pdfs/lpn.pdf
13. J. Katz and J.S. Shin, “Parallel and Concurrent Security of the HB and HB+ Protocols”, EUROCRYPT2006, Lecture Notes in Computer Science, vol. 4004, pp. 73-87, 2006.
14. K. Khoo, G. Gong and H.-K. Lee, “The Rainbow Attack on Stream Ciphers Based on Maiorana-McFarland Functions”, Applied Cryptography and Network Security - ACNS 2006, Lecture Notes in Computer Science, vol. 3989, pp. 194-209, 2006.
15. W. Meier and O. Staffelbach, “Fast Correlation Attacks on Certain Stream Ci-phers,” Journal of Cryptology, vol. 1, pp. 159-176, 1989.
16. M.J. Mihaljević, M.P.C. Fossorier and H. Imai, “A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation”, AAECC2006, Lecture Notes in Computer Science, vol. 3857, pp. 203-214, 2006.
17. M.J. Mihaljević, M.P.C. Fossorier and H. Imai, “Fast Correlation Attack Algorithm with List Decoding and an Application”, FSE2001, Lecture Notes in Computer Science, vol. 2355, pp. 196-210, 2002.
18. O. Regev, “On Lattices, Learning with Errors, Random Linear Codes, and Cryp-tography”, 37th ACM Symposium on Theory of Computing, Proceedings, pp. 84-93, 2005.
19. T. Siegenthaler, “Decrypting a Class of Stream Ciphers Using Ciphertext Only,” IEEE Trans. Comput., vol. C-34, pp. 81-85, 1985.
20. D. Wagner, “A Generalized Birthday Problem,” CRYPTO ’02, Lecture Notes in Computer Science, vol. 2442, pp. 288-304, 2002.