Key distribution using Goldbach triples.

摘要

Key distribution refers to the task of distributing secret keys between communicating parties to provide security properties such as secrecy and authentication. Key pre-distribution scheme has three phases: key distribution, shared key discovery, path-key establishment. During these phases, secret keys are generated, placed in sensor nodes, and each sensor node searches the area in its communication range to find another node to communicate. In this thesis, distribution of secret keys and path establishment are done using Goldbach triples, which are the number of three prime partitions of an odd number. In addition to presenting randomness properties of these triples, which turn out to be similar to that of prime partitions of even numbers, we explore the question of restricted partition sets. A protocol for key distribution that is based on the Goldbach numbers is proposed. Two of the three partitions of the randomly chosen number serve as cover to send the third number to the two parties that wish to communicate with each other. This third number can serve as session key and the original number of which it is a partition can be used for audit purposes.