Abstract
Considered as the main element for building Internet of Things, Radio Frequency IDentification (RFID) is a non-contact automatic identification technology that identifies the tag signal, in order to collect instructions that should be transmitted to the controller. However, it suffers from some threats (i.e. physical attacks, eavesdropping, cloning, tracking, etc.). Thus, ensuring data privacy becomes one of the paramount security interests. Hash functions are an essential mechanism in achieving data integrity. Nevertheless, the heavy duty classical existent hash functions are unsuitable for these RFID tags, since they require small amount of computation. Accordingly, in this paper, a new lightweight hash function based on cellular automata (L-CAHASH) is proposed. This approach gives a high randomness quality and fast software hashing comparing to well-known lightweight hash functions. The robustness and the efficiency of our new proposed hash function is analyzed and the obtained results show that this new hash function meets the RFID tags’ security requirement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Coetzee, L., Eksteen, J.: The internet of things-promise for the future? an introduction. In: IST-Africa Conference Proceedings. IEEE (2011)
Jing, Q., Vasilakos, A.V., Wan, J., Lu, J., Qiu, D.: QiuSecurity of the internet of things: perspectives and challenges. Wireless Netw. 20(8), 2481–2501 (2014)
Khedr, W.I.: SRFID: a hash-based security scheme for low cost RFID systems. Egypt. Inf. J. 14(1), 89–98 (2013)
Kitsos, P. (ed.): Security in RFID and Sensor Networks. CRC Press, Boca Raton (2016)
Wolfram, S.: A New Kind of Science, vol. 5. Champaign, Wolfram media (2002)
Shin, S.-H., Kim, D.-H., Yoo, K.-Y.: A lightweight multi-user authentication scheme based on cellular automata in cloud environment. In: 1st International Conference on Cloud Networking (CLOUDNET), pp. 176–178. IEEE (2012)
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986). doi:10.1007/3-540-39799-X_32
Küçük, Ö.: Design and analysis of cryptographic hash functions. Leuven: Katholieke Universiteit Leuven (2012)
Poschmann, A.Y.: Lightweight Cryptography: Cryptographic Engineering for a Pervasive World (2009)
Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450–466. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74735-2_31
Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181–197. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78967-3_11
Kavun, E.B., Yalcin, T.: A lightweight implementation of Keccak hash function for radio-frequency identification applications. In: Ors Yalcin, S.B. (ed.) RFIDSec 2010. LNCS, vol. 6370, pp. 258–269. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16822-2_20
Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 222–239. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22792-9_13
Bogdanov, A., Knežević, M., Leander, G., Toz, D., Varıcı, K., Verbauwhede, I.: spongent: a lightweight hash function. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 312–325. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23951-9_21
Aumasson, J.P., Henzen, L., Meier, W., Naya-Plasencia, M.: Quark: a lightweight hash. J. Cryptol. 26, 313–339 (2013)
Berger, T.P., D’Hayer, J., Marquet, K., Minier, M., Thomas, G.: The GLUON family: a lightweight hash function family based on FCSRs. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 306–323. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31410-0_19
Mukundan, P.M., Manayankath, S., Srinivasan, C., Sethumadhavan, M.: Hash-One: a lightweight cryptographic hash function. In: IET Information Security (2016)
Kuila, S., Saha, D., Pal, M., Chowdhury, D.R.: CASH: cellular automata based parameterized hash. In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds.) SPACE 2014. LNCS, vol. 8804, pp. 59–75. Springer, Cham (2014). doi:10.1007/978-3-319-12060-7_5
Castroa, J.C.H., Sierrab, J.M., Sezneca, A., Izquierdoa, A., Ribagordaa, A.: The strict avalanche criterion randomness test. Math. Comput. Simul. 68, 1–7 (2005)
Marsaglia, G.: Computer code DIEHARD http://stat.fsu.edu/pub/diehard/. Accessed 31 Jan 2017
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hanin, C., Echandouri, B., Omary, F., El Bernoussi, S. (2017). L-CAHASH: A Novel Lightweight Hash Function Based on Cellular Automata for RFID. In: Sabir, E., García Armada, A., Ghogho, M., Debbah, M. (eds) Ubiquitous Networking. UNet 2017. Lecture Notes in Computer Science(), vol 10542. Springer, Cham. https://doi.org/10.1007/978-3-319-68179-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-68179-5_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68178-8
Online ISBN: 978-3-319-68179-5
eBook Packages: Computer ScienceComputer Science (R0)