Relating Boolean Gate Truth Tables to One-Way Functions
Date: March 3, 2008
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: In this paper, the authors present a schema to build one way functions from a family of Boolean gates. Moreover, the authors relate characteristics of these Boolean gate truth tables to properties of the derived one-way functions. The authors believe this to be the first attempt at establishing cryptographic properties from the Boolean cube spaces of the component gates. This schema is then used to build a family of compression functions, which in turn can be used to get block encryption and hash functions. These functions are based on reconfigurable gates. The authors prove cryptographically relevant properties for these function implementations. Various applications incorporating these one-way functions, specifically memory integrity in processor architecture, are presented.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc132996/
Architecture Support for 3D Obfuscation
Date: May 2006
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This article discusses architecture support for 3D obfuscation. Abstract: Software obfuscation is defined as a transformation of a program P into T(P) such that the whitebox and blackbox behaviors of T(P) are computationally indistinguishable. However, robust obfuscation is impossible to achieve with the existing software only solutions. This results from the power of the adversary model in DRM which is significantly more than in the traditional security scenarios. The adversary has complete control of the computing node - supervisory privileges along with the full physical as well as architectural object observational capabilities. In essence, this makes the operating system (or any other layer around the architecture) untrustworthy. Thus the trust has to be provided by the underlying architecture. In this paper, the authors develop an architecture to support 3-D obfuscation through the use of well known cryptographic methods. The three dimensional obfuscation hides the address sequencing, the contents associated with an address, and the temporal reuse of address sequences such as in loops (or the second order address sequencing). The software is kept as an obfuscated file system image statically. Moreover, its execution traces are also dynamically obfuscated along all the three dimensions of address sequencing, contents and second order ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc132973/
Dynamic Agent Population in Agent-Based Distance Vector Routing
Date: August 2002
Creator: Amin, Kaizar A. & Mikler, Armin R.
Description: This paper discusses dynamic agent population in agent-based distance vector routing. Abstract: The Intelligent mobile agent paradigm can be applied to a wide variety of intrinsically parallel and distributed applications. Network routing is one such application that can be mapped to an agent-based approach. The performance of any agent-based system will depend on its agent population. Although a lot of research has been conducted on agent-based systems, little consideration has been given to the importance of agent population in dynamic networks. A large number of constituent agents can increase the resource overhead of the system, thereby impeding the overall performance of the network. Hence, it is imperative to find the optimal number of agents in the system that would maximize the efficiency of the agent-based mechanism in the network. This optimal value cannot be determined manually, thereby emphasizing the need for an adaptive approach that manipulates the number of agents in the system based on its resource availability. This paper discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing and also describes an adaptive approach controlling the number of agents in the network using pheromones and discusses their limitations.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc132968/
Dynamic intimate contact social networks and epidemic interventions
Date: 2008
Creator: Corley, Courtney; Mikler, Armin R.; Cook, Diane J., 1963- & Singh, Karan P.
Description: This article discusses dynamic intimate contact social networks and epidemic interventions. Abstract: Sexually transmitted diseases and infections are, by definition, transferred among intimate social settings. Although the circumstances under which these social settings are established and maintained may vary, the common prerequisite remains an intimate level of social atmosphere. For this reason, the development of sexually transmitted disease mathematical and computational models must utilize dynamic and evolving social network simulation. This paper presents DynSNIC (Dynamic Social Network of Intimate Contacts), a computational simulator created to embody the intimate dynamic and evolving social networks related to the transmission of sexually transmitted diseases and infections. DynSNIC's utilization by health professionals will facilitate evaluation of targeted intervention strategies and public health policies.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc132993/
Framework for Design Validation of Security Architectures
Date: November 17, 2008
Creator: Dwoskin, Jeffrey Scott, 1980-; Gomathisankaran, Mahadevan & Lee, Ruby Bei-Loh
Description: This technical report discusses a framework for design validation of security architectures. Abstract: New security architectures are difficult to prototype and test. They require interactions between hardware, operating systems, and applications, making them hard to simulate and monitor. The authors have designed and prototyped a testing framework using a virtualization platform which emulates the behavior of new hardware security architecture in the virtual CPU, and performs a wide range of hardware and software attacks on the system under test. The authors' testing framework significantly speeds up development of the testing environment and infrastructure, and provides APIs for launching attacks and monitoring the effects of an attack on the hardware and software layers, which is especially convenient during the design and validation phases for new hardware-software architectural solutions. The authors have used this testing framework to test the trust chain of the SP architecture as an example.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc130192/
Transformational Paradigm for Engineering and Engineering Technology Education
Date: November 2008
Creator: Barbieri, Enrique & Fitzgibbon, William
Description: This paper discusses a transformational paradigm for engineering and engineering technology education. The knowledge explosion in science, technology, engineering & mathematics (STEM) over the past decades is unquestionably overwhelming. It is important that those involved in STEM quickly adapt. Life-long learning has taken a do-or-die slant, as technological breakthroughs turn obsolete within only a few years of their inception. Medical and law degree curricula became more "professional" and require a "pre-degree" status to be considered for admission. However, the traditional engineering degree plan is essentially the same as that of the mid 20th Century. Legislation in some states places additional pressure on baccalaureate degrees by questioning the need for anything above 120 credit hours. The result is (i) fewer engineering-specific courses; (ii) courses that heavily emphasize theory; and (iii) a subsequent reduction in hands-on, laboratory oriented, experimental learning. Engineering Technology curricula are designed to have experiential learning as the educational backbone. This forces a reduction in mathematical and scientific depth that is compensated by a richness of laboratory courses in almost one-to-one proportion to lecture courses, and which emphasize the application of engineering. The main challenges to establish and maintain experiential learning include (i) availability of slots in the curricula ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc115194/
Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks
Date: March 25, 2002
Creator: Amin, Kaizar A. & Mikler, Armin R.
Description: This article discusses agent-based distance vector routing. Abstract: In spite of the ever-increasing availability of computation and communication resources in modern networks, the overhead associated with network management protocols, such as traffic control and routing, continues to be an important aspect in the design of new methodologies. Resource efficiency of such protocols has become even more prominent with the recent developments of wireless and ad-hoc networks, which are marked by much more severe resource constraints in terms of bandwidth, memory, and computational capabilities. This paper presents an Agent-Based approach to Distance Vector Routing that addresses these resources constraints. Agent-Based Distance Vector Routing (ADVR) is a resource efficient implementation of Distance Vector Routing that is fault tolerant and scales well for large networks. ADVR draws upon some basic biologically inspired principles to facilitate coordination among the mobile agents that implement the routing task. Specifically, simulated pheromones are used to control the movement of agents within the network and to dynamically adjust the number of agents in the population. The behavior of ADVR is analyzed and compared to that of traditional Distance Vector Routing.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc111275/
WARM SRAM: A Novel Scheme to Reduce Static Leakage Energy in SRAM Arrays
Date: February 2004
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This presentation accompanies a paper discussing research on a novel scheme to reduce static leakage energy in SRAM arrays. The increasing sub-threshold leakage current levels with newer technology nodes have been identified by ITRS (2001) as one of the major fundamental problems faced by the semiconductor industry. Concurrently, the expected performance improvement and functionality integration expectations drive the continued reduction in feature size. This results in ever-increasing power per unit area and the accompanying problem of heat removal and cooling as stated in J.M.C. Stork (1995). Portable battery-powered applications, fuelled by pervasive and embedded computing, have seen tremendous growth and have reached a point where battery energy and power density can't be increased further according to T. Bell (1991). This raises the computational throughput per watt target for the future technology nodes. SRAM arrays which are used widely as a system component, such as caches and register files, in both high-performance and portable systems, are getting to be dominant power consumers because of their large capacity and area. Hence any reduction in cache energy can result in considerable overall power reduction. The authors propose a novel circuit technique using depletion mode devices, to reduce the static energy of SRAM array ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc96819/
REBEL: Reconfigurable Block Encryption Logic
Date: September 1, 2006
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This paper discusses reconfigurable block encryption logic. Existing block cipher function designs have tended to deploy the secret bits in a specific and limited way. The authors generalize the role of the secret as truth tables of Boolean gates in a carefully designed logic schema. The authors' claims are: these reconfigurable functions are pseudo one-way and pseudo random functions. Such a function family is proposed using reconfigurable gates. Based on this function family the authors create REBEL, Reconfigurable Block Encryption Logic, which is an LR-Network. The authors prove cryptographic and cryptanalytic security for REBEL. From cryptographic perspective, this function is a pseudo-permutation. From cryptanalysis perspective, any observable attribute appears to be a random process.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc96662/
Secure execution environments through reconfigurable lightweight cryptographic components
Date: 2006
Creator: Gomathisankaran, Mahadevan
Description: This doctoral dissertation discusses secure execution environments through reconfigurable lightweight cryptographic components. Software protection is one of the most important problems in the area of computing as it affects a multitude of players like software vendors, digital content providers, users, and government agencies. There are multiple dimensions to this broad problem of software protection. The most important ones are: 1) protecting software from reverse engineering. 2) protecting software from tamper (or modification). 3) preventing software piracy. 4) verification of integrity of the software. In this thesis the authors focus on these areas of software protection. The basic requirement to achieve these goals is to provide a secure execution environment, which ensures that the programs behave in the same way as it was designed, and the execution platforms respect certain types of wishes specified by the program. The authors take the approach of providing secure execution environment through architecture support. The authors exploit the power of reconfigurable components in achieving this. The first problem the authors consider is to provide architecture support for obfuscation. This also achieves the goals of tamper resistance, copy protection, and IP protection indirectly. The authors' approach is based on the intuition that the software is a ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc96840/