Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

Security Systems Based On Gaussian Integers : Analysis Of Basic Operations And Time Complexity Of Secret Transformations, Aleksey Koval Aug 2011

Security Systems Based On Gaussian Integers : Analysis Of Basic Operations And Time Complexity Of Secret Transformations, Aleksey Koval

Dissertations

Many security algorithms currently in use rely heavily on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common security protocols with Gaussian integers. Although the main contribution of this work is to analyze and improve the application of Gaussian integers for various public key (PK) algorithms, Gaussian integers were studied in the context of image watermarking as well.

The significant benefits of the application of Gaussian integers become apparent when they are used with Discrete Logarithm Problem …


Hardening Software Against Memory Errors And Attacks, Albert Eugene Novark Feb 2011

Hardening Software Against Memory Errors And Attacks, Albert Eugene Novark

Open Access Dissertations

Programs written in C and C++ are susceptible to a number of memory errors, including buffer overflows and dangling pointers. At best, these errors cause crashes or performance degradation. At worst, they enable security vulnerabilities, allowing denial-of-service or remote code execution. Existing runtime systems provide little protection against these errors. They allow minor errors to cause crashes and allow attackers to consistently exploit vulnerabilities. In this thesis, we introduce a series of runtime systems that protect deployed applications from memory errors. To guide the design of our systems, we analyze how errors interact with memory allocators to allow consistent exploitation …


An Analysis Of Remote Biometric Authentication With Windows, Brandy Marie Eyers Jan 2011

An Analysis Of Remote Biometric Authentication With Windows, Brandy Marie Eyers

USF Tampa Graduate Theses and Dissertations

One thing that everyone seems to be worried about when it comes to his or her computer is security. If your computer is not secure then private information could be stolen. Many people now use passwords to protect themselves though they are discovering that using multi-factor authentication is much more secure. It allows you to use multiple different proofs of who you are. Biometrics is one of the ways to prove identity. Using it, you could log into a system with just a fingerprint, which is something that is very difficult to steal. We present a suite of software tools …


Grouper: A Packet Classification Algorithm Allowing Time-Space Tradeoffs, Joshua Adam Kuhn Jan 2011

Grouper: A Packet Classification Algorithm Allowing Time-Space Tradeoffs, Joshua Adam Kuhn

USF Tampa Graduate Theses and Dissertations

This thesis presents an algorithm for classifying packets according to arbitrary (including noncontiguous) bitmask rules. As its principal novelty, the algorithm is parameterized by the amount of memory available and can customize its data structures to optimize classification time without exceeding the given memory bound. The algorithm thus automatically trades time for space efficiency as needed. The two extremes of this time-space tradeoff (linear search through the rules versus a single table that maps every possible packet to its class number) are special cases of the general algorithm we present. Additional features of the algorithm include its simplicity, its open-source …


Modularizing Crosscutting Concerns In Software, Nalin Saigal Jan 2011

Modularizing Crosscutting Concerns In Software, Nalin Saigal

USF Tampa Graduate Theses and Dissertations

Code modularization provides benefits throughout the software life cycle; however, the presence of crosscutting concerns (CCCs) in software hinders its complete modularization. Traditional modularization techniques work well under the assumption that code being modularized is functionally orthogonal to the rest of the code; as a result, software engineers try to separate code segments that are orthogonal in their functionality into distinct modules. However, in practice, software does not decompose neatly into modules with distinct, orthogonal functionality. In this thesis, we investigate the modularization of CCCs in software using two different techniques.

Firstly, we discuss IVCon, a GUI-based tool that provides …


Exploring Identity Management At Community Colleges In Texas With Open Access To College Computer Networks, Michael John Callahan Jan 2011

Exploring Identity Management At Community Colleges In Texas With Open Access To College Computer Networks, Michael John Callahan

Walden Dissertations and Doctoral Studies

The study addressed the lack of identity management practices in Texas community colleges to identify guest users who access college computers. Guest user access is required by Texas law and is part of the state's mission to bridge the technology gap; however, improper identification methods leave the college vulnerable to liability issues. The purpose of this study was to eliminate or mitigate liabilities facing colleges by creating and using security policies to identify guest users. This study combined the theoretical concepts of Cameron's internal security management model with the external trust models of the Liberty Alliance and Microsoft's Passport software. …