Abstract
Resource constraint sensors of a Wireless Sensor Network (WSN) cannot afford the use of costly encryption techniques like public key while dealing with sensitive data. So symmetric key encryption techniques are preferred where it is essential to have the same cryptographic key between communicating parties. To this end, keys are preloaded into the nodes before deployment and are to be established once they get deployed in the target area. This entire process is called key predistribution. In this paper we propose one such scheme using unique factorization of polynomials over Finite Fields. To the best of our knowledge such an elegant use of Algebra is being done for the first time in WSN literature. The best part of the scheme is large number of node support with very small and uniform key ring per node. However the resiliency is not good. For this reason we use a special technique based on Reed Muller codes proposed recently by Sarkar, Saha and Chowdhury in 2010. The combined scheme has good resiliency with huge node support using very less keys per node.
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
Preview
Unable to display preview. Download preview PDF.
References
Artin, M.: Algebra. Prentice Hall, India (2010) ISBN-81-203-0871-9
Bag, S., Ruj, S.: Key Distribution in Wireless Sensor Networks using Finite Affine Plane. In: AINA 2011, pp. 436–442. IEEE Computer Society, Los Alamitos (2011)
Bernstein, D.: Polynomial evaluation and message authentication (2007) http://cr.yp.to/antiforgery/pema-20071022.pdf
Çamtepe, S.A., Yener, B.: Key distribution mechanisms for wireless sensor networks: A survey. Technical Report (TR-05-07), Rensselaer Polytechnic Institute, Computer Science Department (2005)
Chakrabarti, D., Maitra, S., Roy, B.: A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. International Journal of Information Security 5(2), 105–114 (2006)
Cooke, B.: Reed Muller Error Correcting Codes. MIT Undergraduate J. of Mathematics (1999)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: ACM Conference on Computer and Communications Security, pp. 41–47 (2002)
Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing elliptic curve cryptography and RSA on 8-bit cPUs. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119–132. Springer, Heidelberg (2004)
Gallian, J.: Contemporary Abstract Algebra. Narosa Publishing House, India (2004) ISBN-81-7319-269-3
Lee, J.-Y., Stinson, D.R.: Deterministic key predistribution schemes for distributed sensor networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 294–307. Springer, Heidelberg (2004)
Lee, J.Y., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference, WCNC 2005, New Orleans, LA, USA (2005)
Ruj, S., Roy, B.: Key predistribution using partially balanced designs in wireless sensor networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 431–445. Springer, Heidelberg (2007)
Ruj, S., Roy, B.: Key predistribution schemes using codes in wireless sensor networks. In: Yung, M., Liu, P., Lin, D. (eds.) Inscrypt 2008. LNCS, vol. 5487, pp. 275–288. Springer, Heidelberg (2009)
Al-Shurman, M., Yoo, S.M.: Key pre-distribution using MDS codes in mobile ad hoc networks. In: ITNG, pp. 566–567. IEEE Computer Society Press, Los Alamitos (2006)
Steiner, J.G., Neuman, B.C., Schiller, J.I.: Kerberos: An authentication service for open network systems. In: USENIX Winter, pp. 191–202 (1988)
Sarkar, P., Saha, A., Chowdhury, M.U.: Secure Connectivity Model in Wireless Sensor Networks Using First Order Reed-Muller Codes. In: MASS 2010, pp. 507–512 (2010)
Xu, D., Huang, J., Dwoskin, J., Chiang, M., Lee, R.: Re-examining probabilistic versus deterministic key management. In: Proceedings of the 2007 IEEE International Symposium on Information Theory (ISIT), pp. 2586–2590 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarkar, P., Chowdhury, M.U. (2011). Key Predistribution Scheme Using Finite Fields and Reed Muller Codes. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2011. Studies in Computational Intelligence, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22288-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22288-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22287-0
Online ISBN: 978-3-642-22288-7
eBook Packages: EngineeringEngineering (R0)