Arunkumar Venkatramani, Muralidhar Narasimhan, Ramadass Nagarajan
In this project, we propose to analyze quantitatively the costs and feasibility of universal encryption, considering various performance metrics that may be desired in a personal environment. We propose to construct a quantitative case to validate or refute the hypothesis stated as, 'all network communication can be encrypted at low costs'. We also propose to identify and analyze precisely a class of applications and environment where this hypothesis may hold or fail.