A generalisation of the Diffie-Hellman protocol is studied in this dissertation. In the generalisation polynomials are used to reduce the representation size of a public key and linear shift registers for more efficient computations. These changes are important for the implementation of the protocol in con- strained environments. The security of the Diffie-Hellman protocol and its generalisation is based on the same computations problems. Lastly three examples of the generalisation and their implementation are discussed. For two of the protocols, models are given to predict the execution time and it is determined how well these model predictions are. / Dissertation (MSc (Applied Mathematics))--University of Pretoria, 2007. / Mathematics and Applied Mathematics / MSc / unrestricted
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:up/oai:repository.up.ac.za:2263/24053 |
| Date | 21 April 2008 |
| Creators | Van der Berg, J.S. |
| Contributors | Pretorius, Lou M. (Lourens Martin), baardseun@gmail.com |
| Publisher | University of Pretoria |
| Source Sets | South African National ETD Portal |
| Detected Language | English |
| Type | Dissertation |
| Rights | © University of Pretor |
Page generated in 0.0019 seconds