JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM ›› 2017, Vol. 24 ›› Issue (5): 16-22.doi: 10.1016/S1005-8885(17)60229-2

• Security • Previous Articles     Next Articles

New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks

Chen Shangdi, Wen Jiejing   

  1. 1. College of Science, Civil Aviation University of China, Tianjin 300300, China
    2. The Chern Institute of Mathematics, Nankai University, Tianjin 300071, China
  • Received:2017-06-26 Revised:2017-09-25 Online:2017-10-30 Published:2017-12-18
  • Contact: Chen Shangdi, E-mail:
  • About author:Chen Shangdi, E-mail:
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61179026), and the Fundamental Research Funds for the Central Universities (3122016L005).


To achieve secure communication in wireless sensor networks (WSNs), where sensor nodes with limited computation capability are randomly scattered over a hostile territory, various key pre-distribution schemes (KPSs) have been proposed. In this paper, a new KPS is proposed based on symplectic geometry over finite fields. A fixed dimensional subspace in a symplectic space represents a node, all 1-dimensional subspaces represent keys and every pair of nodes has shared keys. But this naive mapping does not guarantee a good network resiliency. Therefore, it is proposed an enhanced KPS where two nodes have to compute a pairwise key, only if they share at least q common keys. This approach enhances the resilience against nodes capture attacks. Compared with the existence of solution, the results show that new approach enhances the network scalability considerably, and achieves good connectivity and good overall performance.

Key words: pre-distribution scheme, symplectic geometry, WSNs

CLC Number: