Skip to main content
SpringerLink
Log in

A New (n, n) Blockcipher Hash Function Using Feistel Network: Apposite for RFID Security

  • Conference paper
  • First Online:
Computational Intelligence in Data Mining - Volume 3

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 33))

Abstract

In this paper, we proposed a new (n, n) double block length hash function using Feistel network which is suitable for providing security to the WSN (wireless sensor network) device or RFID tags. We use three calls of AES-128 (E 1, E 2, E 3) in a single blockcipher E′ so that the efficiency rate is 0.33. Surprisingly we found that the security bound of this scheme is better than other famous (n, n) based blockcipher schemes such as MDC-2, MDC-4, MJH. The collision resistance (CR) and preimage resistance (PR) security bound are respectively by O(2n) and O(22n). We define our new scheme as JAIST according to our institute name.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Armknecht, F., Fleischmann, E., Krause, M., Lee, J., Stam, M., Steinberger, J.: The Preimage Security of Double-Block-Length Compression Functions. LNCS. ASIACRYPT, vol. 7073, pp. 233–251. Springer, Berlin (2011)

    Google Scholar 

  2. Black, J.A., Rogaway, P., Shrimpton, T.: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. LNCS, CRYPTO, vol. 2442, pp. 320–335. Springer, Berlin (2002)

    Google Scholar 

  3. Black, J.A., Rogaway, P., Shrimpton, T., Stam, M.: An analysis of the blockcipher-based hash functions from PGV. J. Cryptol. 23, 519–545 (2010)

    Google Scholar 

  4. Bogdanov A., Leander G., Paar C., Poschmann A., Robshaw, M.J.B., Seurin, Y.: Hash Functions and RFID Tags: Mind the Gap. LNCS, CHES, vol. 5154, pp. 283–299. Springer, Berlin (2008)

    Google Scholar 

  5. Fleischmann, E., Forler, C., Gorski, M., Lucks, S.: Collision Resistant Double-Length Hashing. LNCS, PROVSEC, vol. 6402, pp. 102–118. Springer, Berlin (2010)

    Google Scholar 

  6. Fleischmann, E., Forler, C., Lucks, S., Wenzel, J.: Weimar-DM: A Highly Secure Double Length Compression Function. LNCS, ACISP, vol. 7372, pp. 152–165. Springer, Berlin (2012)

    Google Scholar 

  7. Hirose, S.: Some Plausible Constructions of Double-Block-Length Hash Functions. LNCS, FSE, vol. 4047, pp. 210–225. Springer, Berlin (2006)

    Google Scholar 

  8. Jesang, L., Seokhie, H., Jaechul, S., Haeryong, P.: A New Double-Block-Length Hash Function Using Feistel Structure. LNCS, ISA, vol. 5576, pp. 11–20. Springer, Berlin (2009)

    Google Scholar 

  9. Kaps, J.P., Sunar, B.: Energy Comparison of AES and SHA-1 for Ubiquitous Computing. LNCS, Emerging Directions in Embedded and Ubiquitous Computing, vol. 4097, pp. 372–381. Springer, Berlin (2006)

    Google Scholar 

  10. Knudsen, L., Preneel, B.: Fast and Secure Hashing Based on Codes. LNCS, CRYPTO, vol. 1294, pp. 485–498. Springer, Berlin (1997)

    Google Scholar 

  11. Lai, X., Massey, X.: Hash Function Based on Block Ciphers. LNCS, EUROCRYPT, vol. 658, pp. 55–70. Springer, Berlin (1993)

    Google Scholar 

  12. Lee, J., Kwon, D.: The security of abreast-DM in the ideal cipher model. IEICE Trans. 94-A(1), 104–109 (2011)

    Article  Google Scholar 

  13. Lee, J., Stam, M.: MJH: A Faster Alternative to MDC-2. LNCS, CT-RSA, vol. 6558, pp. 213–236. Springer, Berlin (2011)

    Google Scholar 

  14. Lee, J., Kapitanova, K., Son, S.H.: The price of security in wireless sensor networks. Comput. Netw. 54(17), 2967–2978 (2010)

    Article  Google Scholar 

  15. Lee, J., Stam, M., Steinberger, J.: The Collision Security of Tandem-DM in the Ideal Cipher Model. LNCS, CRYPTO, vol. 6841, pp. 561–577. Springer, Berlin (2011)

    Google Scholar 

  16. Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, 5th edn. CRC Press, Boca Raton (2001)

    Google Scholar 

  17. Mennink, B.: Optimal Collision Security in Double Block Length Hashing with Single Length Key. LNCS, ASIACRYPT, vol. 7658, pp. 526–543. Springer, Berlin (2012)

    Google Scholar 

  18. Ozen, O., Stam, M.: Another Glance at Double-Length Hashing. LNCS. Cryptography and Coding, vol. 5291, pp. 176–201. Springer, Berlin (2009)

    Google Scholar 

  19. Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 128–134, 656–715 (1949)

    Google Scholar 

  20. Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. LNCS, EUROCRYPT, vol. 3494, pp. 1–18. Springer, Berlin (2005)

    Google Scholar 

  21. Wang, X., Lai, X., Yu, X.: Finding Collisions in the Full SHA-1. LNCS, CRYPTO, vol. 3621, pp. 17–36. Springer, Berlin (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Japan Advanced Institute of Science and Technology, 1-1, Asahidai, Nomi-Shi, Ishikawa, Japan

    Atsuko Miyaji & Mazumder Rashed

Authors
  1. Atsuko Miyaji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mazumder Rashed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Atsuko Miyaji .

Editor information

Editors and Affiliations

  1. School of Electrical and Information Engineering, University of South Australia, South Australia, Australia

    Lakhmi C. Jain

  2. Computer Science and Engineering, Veer Surendra Sai University of Technolo, Sambalpur, Odisha, India

    Himansu Sekhar Behera

  3. Computer Science & Engineering, Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  4. Dept. of Computer Science and Eng., National Institute of Technology Rourkela, Rourkela, India

    Durga Prasad Mohapatra

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Miyaji, A., Rashed, M. (2015). A New (n, n) Blockcipher Hash Function Using Feistel Network: Apposite for RFID Security. In: Jain, L., Behera, H., Mandal, J., Mohapatra, D. (eds) Computational Intelligence in Data Mining - Volume 3. Smart Innovation, Systems and Technologies, vol 33. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2202-6_47

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2202-6_47

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2201-9

  • Online ISBN: 978-81-322-2202-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation