Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. Includes bibliographical references (leaves 119-137).

Thesis (Master)--İzmir Institute Of Technology, İzmir, 2006 / Keywords: Specification, crytography. Includes bibliographical references (leaves. 46-47).

Thesis (M.S.)--Worcester Polytechnic Institute. / Includes bibliographical references (leaves 106-107).

Dissertation (Ph.D.)--Worcester Polytechnic Institute. / Keywords: Pairing Based Cryptography; Identity Based Cryptography; Tate Pairing; Montgomery Multiplication; Robust Codes; Fault Detection; Tamper-Resilient Architecture. Includes bibliographical references (leaves 97-104).

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: Finite fields; implementation. Includes bibliographical references (leaves 59-62).

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains x, 80 p.; also contains graphics. Includes vita. Includes bibliographical references.

- / -

The research paper Fully Homomorphic Encryption over the Integers by van Dijk, Gentry, Halevi, and Vaikuntanathan [31] explores the construction of an encryption scheme over the integers that is fully homomorphic, using modular arithmetic. The plaintext messages in this encryption are single bits and the ciphertexts are large integers. The homomorphic property means that the algebraic operations on the plaintexts can be carried out analogously on the ciphertexts. We analyze in detail the parameter constraints required to make the scheme functional and secure, prove auxiliary results about noise accumulation, and generate a toy example to concretely illustrate parts of the scheme.

M.Sc. (Computer Science) / The main themes of this thesis are the characteristics of natural language, cryptographic algorithms to encipher natural language and possible figures of merit with which to compare different cryptographic algorithms. In this thesis the characteristics of natural language and the influence this has on cryptographic algorithms is investigated. The entropy function of Shannon is used extensively to evaluate the different models that can be constructed to simulate natural language. Natural language redundancy is , investigated and quantified by the entropy function. The influence this redundancy has on the theoretic security of different algorithms is tabulated. Shannon's unicity distance is used as a measure of security for this purpose. The unicity distance is already shown at this early stage to be not a very accurate measure of real (practical) security of cryptographic ciphers. The cryptographic algorithms discussed in this thesis are arbitarily divided into three groups: classical algorithms, public key algorithms and computer algorithms. In the classical algorithms cryptographic techniques such as transposition and character substitution are included. Well known ciphers such as the Playfair and Hill encipherment schemes are also included as classical cryptographic techniques. A special section is devoted to the use and cryptanalytic techniques of polyaphabetic ciphers. The public key ciphers are divided into three main groups: knapsack ciphers, RSA type ciphers and discrete logarithmic systems. Except for the discrete logarithmic cipher several examples of the other two groups are given. Examples of knapsack ciphers are: Merkle Hellman knapsack, Graham-Shamir knapsack and Shamir's random knapsack.

M.Sc. (Computer Science) / Since the emergence of electronic communication, scientists have strived to make these communication systems as secure as possible. Classical cryptographical methods provided secrecy, with the proviso that the courier delivering the keys could be trusted. This method of key distribution proved to be too inefficient and costly. 'Cryptographical renaissance' was brought about with the advent of public key cryptography, in which the message key consists of a pair of mathematically complementary keys, instead of the symmetric keys of its forerunner. Classical cryptographical techniques were by no means obsolete, as the idea of using 'hybrid' systems proved to be very effective, by using the tedious public key techniques to allow both parties to share a secret, and the more efficient symmetric algorithms to actually encrypt the message. New technology leads, however, to new difficulties and the problems of key management now arose. Various protocols started emerging as solutions to the key distribution problem, each with their own advantages and disadvantages. The aim of this work is to critically review these protocols, analyse the shortfalls and attempt to design a protocol which will overcome these shortfalls. The class of protocol reviewed are the so-called 'strong authentication' protocols, whereby interaction between the message sender and recipient is required.