Date(s) - 27/10/2016
4:00 pm - 5:00 pm
Key distribution becomes very important especially in sensor networks. In order to have an encrypted communication over insecure channels in an efficient way, each node should share a private key. Although using symmetric algorithms are efficient, they are not suitable for key distribution. On the other hand, the overhead of asymmetric algorithms are very high for sensor nodes. Today, I will talk about a cryptographic key distribution algorithm which uses benefits of group theory and importance of the difficulty of prime factorization problem. In the first part of the talk, I will give details of the underlying ideas and will finish my talk after briefly mentioning implementation details of the algorithm.