Secure Key Transfer Protocol Using Goldbach Sequences

Cryptography has been most successfully deployed in protocols where a client-server relationship exists, such as Secure Socket Layer(SSL) and Transport Layer security(TSL). A data can be encrypted using an encryption algorithm along with a public key. This encrypted data could be read by the node which has the private key of this encrypted data which can decrypt the message. A signature is formed together with a message digest and a private key. It makes it impossible to detect the message digest given a key and also it would be impossible to detect the key given a message digest. Other variations are given in [13],[14].In this thesis we consider a new way to develop a key distribution protocol using the standard Goldbach conjecture and its constrained forms. According to this conjecture any even number can be represented as a sum of two prime numbers. We have looked at random sequences obtained from the count of partitions of different even numbers and we have derived new variant sequences of this partition random sequence. Random sequences can be good candidates for cryptographic keys [15]-[18] and they have other applications in cryptography. When random sequences from different sources are used, their independence may be checked by a cross correlation analysis [19]-[21].Goldbach partitions will be shown to have excellent cross correlation properties. We also present the use of Goldbach partitions for a key exchange protocol.Computer Scienc

Authentication for Multi-located Parties and Wireless Ad Hoc Networks

This thesis present a new authentication protocol for multi-located parties which uses an agent based scheme that divides the message into two parts together with a key distribution center to ensure stronger authentication. It also presents a protocol for wireless ad hoc networks to combat spamming and reduce traffic overload. The appropriate number of authentication agents was calculated for a wireless ad hoc network. Simulations were run for networks of 200, 1000, 2000 and 4000 nodes and it was found that 0.075 n (n is the number of nodes in the network) authentication agents work well to distribute the load evenly amongst them.Computer Science Departmen