Encryption algorithms have been used since the dawn of time to ensure secure communication over insecure communication channels. Once a secret encryption key is established and as long as the key remains secret, two parties can communicate freely over open channels. The question of how to obtain such a secret key is a large dilemma. Many methods of obtaining such keys have been tried from the most basic form of a one-on-one encounter to more advanced techniques like Diffie-Hellman. This paper compares three versions of the Diffie-Hellman key exchange protocol -- using arithmetic in the field of integers modulo a prime, arithmetic in an Elliptic Curve field (ECC), and arithmetic in the Extended Compact Subgroup Trace Representation (XTR), respectively -- to determine which would be the most appropriate, in terms of computational efficiency, for a small personal computing device.
Department, Program, or Center
Computer Science (GCCIS)
Kaminsky, Alan - Chair
Campbell, Roderic, "Efficient encryption on limited devices" (2006). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus