No description available.

Abraded and crumpled encryption allows communication software such as messaging platforms to ensure privacy for their users while still allowing for some investigation by law enforcement. Crumpled encryption ensures that each decryption is costly and prevents law enforcement from performing mass decryption of messages. Abrasion ensures that only large organizations like law enforcement are able to access any messages. The current abrasion construction uses public key parameters such as prime numbers which makes the abrasion scheme difficult to analyze and allows possible backdoors. In this thesis, we introduce a new abrasion construction which uses hash functions to avoid the problems with the current abrasion construction. In addition, we present a proof-of-concept for using crumpled encryption on an email server.

Abstract not available

In this thesis, novel solutions are proposed for key management issues in mobile ad hoc networks. Presented Hierarchical Binary Tree (HBT) based model is distributed, self-organizing, scalable and does not employ online key distribution authority or group manager. Two different group authentication and group key establishment protocols are proposed for the users who form an ad hoc group with distributed trust model. Initially proposed protocols are based on public key cryptography and do not use specific algorithm. However, members can establish the keys faster with proposed customized hybrid scheme which combines elliptic curve cryptography, modular squaring operations and secret key encryption algorithm. Proposed HBT based model provides complete backward and forward security in case of modification in membership and it has comparable efficiency to the other HBT based schemes which employ real time key distribution authority. Mutual authentication and link encryption can be achieved in wireless sensor network only with public key cryptography if there are no pre-distributed keys. However, constraints in resources make fully public key operations not affordable on sensor. Three different authenticated key establishment protocols are proposed with an objective of being respectful to constraints. Sensor needs to make only modular or cyclic convolution multiplications, and expensive public key decryption operation is executed at the data processing station side. Schemes require small size of code and achieve the least sensor processing time in comparison with fully public key cryptography based protocols. / Graduation date: 2005

Thesis (M.Eng.)--Memorial University of Newfoundland, 2005. / Includes bibliographical references (leaves 105-112).

Thesis (M.S.)--Brigham Young University. School of Technology, 2006. / Includes bibliographical references (p. 65-67).

Thesis (Ph. D.)--State University of New York at Binghamton, Electrical Engineering Department, 2001. / Includes bibliographical references (leaves 50-52).

Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 129-135). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--Worcester Polytechnic Institute. / Keywords: computer arithmetic; elliptic curves; cryptography. Includes bibliographical references (p. 299-305).

Thesis (M.Eng.)--Memorial University of Newfoundland, 2000. / Bibliography: p. 101-108.