Key Predistribution Scheme Using Finite Fields and Reed Muller Codes

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.

[1]  Bülent Yener,et al.  Key distribution mechanisms for wireless sensor networks : a survey , 2005 .

[2]  Sushmita Ruj,et al.  Key Distribution in Wireless Sensor Networks Using Finite Affine Plane , 2011, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications.

[3]  Hui Gao,et al.  Parallel and Distributed Processing and Applications , 2005 .

[4]  Joseph A. Gallian,et al.  Contemporary Abstract Algebra , 2021 .

[5]  Sushmita Ruj,et al.  Key Predistribution Schemes Using Codes in Wireless Sensor Networks , 2009, Inscrypt.

[6]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[7]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[8]  Morshed U. Chowdhury,et al.  Secure connectivity model in Wireless Sensor Networks (WSN) using first order Reed-Muller codes , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[9]  Marc Joye,et al.  Cryptographic Hardware and Embedded Systems - CHES 2004 , 2004, Lecture Notes in Computer Science.

[10]  Sushmita Ruj,et al.  Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks , 2007, ISPA.

[11]  Hans Eberle,et al.  Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.

[12]  Douglas R. Stinson,et al.  Deterministic Key Predistribution Schemes for Distributed Sensor Networks , 2004, Selected Areas in Cryptography.

[13]  Douglas R. Stinson,et al.  A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[14]  Jianwei Huang,et al.  Re-examining Probabilistic Versus Deterministic Key Management , 2007, 2007 IEEE International Symposium on Information Theory.

[15]  B. Clifford Neuman,et al.  Kerberos: An Authentication Service for Open Network Systems , 1988, USENIX Winter.

[16]  Moti Yung,et al.  Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[17]  Subhamoy Maitra,et al.  A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design , 2005, International Journal of Information Security.

[18]  Seong-Moo Yoo,et al.  Key Pre-Distribution Using MDS Codes in Mobile Ad Hoc Networks , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).