Modern cryptography responds to the need for security that has arisen with the emergence of communication appliances. However, its adapted integration in the wide variety of existing communication systems has opened new design challenges. Amongst them, this thesis addresses two in particular, related to hardware integration of cryptographic algorithms: constrained environments and side-channel security. In the context of constrained environments, we propose to study the interest of the Scalable Encryption Algorithm SEA for constrained hardware applications. We investigate both the FPGA and ASIC contexts and illustrate, using practical implementation results, the interest of this algorithm. Indeed, we demonstrate how hardware implementations can keep its high scalability properties while achieving interesting implementation figures in comparison to conventional algorithms such as the AES. Next, we deal with three complementary aspects related to side-channel resistance. We first propose a new class of dynamic and differential logic families achieving low-power performance with matched leakage of information to state of-the-art countermeasures. We then discuss a power consumption model for these logic styles and apply it to DyCML implementations. It is based on the use of the isomorphism existing between the gate structures of the implemented functions and the binary decision diagrams describing them. Using this model, we are not only able to predict the power consumption, and therefore attack such implementations, but also to efficiently choose the gate structures achieving the best resistance against this model. We finally study a methodology for the security evaluation of cryptographic applications all along their design and test phases. We illustrate the interest of such a methodology at different design steps and with different circuit complexity, using either simulations or power consumption measurements.

Graph traversal represents an important class of graph algorithms that is the nucleus of many large scale graph analytics applications. While improving the performance of such algorithms using GPUs has received attention, understanding and managing performance under power constraints has not yet received similar attention. This thesis first explores the power and performance characteristics of breadth first search (BFS) via measurements on a commodity GPU. We utilize this analysis to address the problem of minimizing execution time below a predefined power limit or power cap exposing key relationships between graph properties and power consumption. We modify the firmware on a commodity GPU to measure power usage and use the GPU as an experimental system to evaluate future architectural enhancements for the optimization of graph algorithms. Specifically, we propose and evaluate power management algorithms that scale i) the GPU frequency or ii) the number of active GPU compute units for a diverse set of real-world and synthetic graphs. Compared to scaling either frequency or compute units individually, our proposed schemes reduce execution time by an average of 18.64% by adjusting the configuration based on the inter- and intra-graph characteristics.

This paper discusses the use of diagnostics based on machine learning (ML) within a flight test context. The paper begins by discussing some of the problems associated with instrumenting a test aircraft and how they could be ameliorated using ML-based diagnostics. We then describe a number of types of supervised ML algorithms which can be used in this context. In addition, key practical aspects of applying these algorithms, such as feature engineering and parameter selection, are also discussed. The paper then outlines a real-world application developed by Curtiss-Wright, called Machine Learning for Advanced System Diagnostics (MLASD). This description includes key challenges that were encountered during the development process and how suitable input features were identified. Real-world results are also presented. Finally, we suggest some further applications of ML techniques, in addition to describing other areas of development.

<p>Cyber physical systems are deployed in a wide range of applications from sensor nodes in a factory setting to drones in defense applications. This distributed setting of nodes or processes often needs to reach agreement on a set of values. Byzantine Agreement protocols address this issue of reaching an agreement in an environment where a malicious entity can take control over a set of nodes and deviates the system from its normal operation. However these protocols do not consider the energy consumption of the nodes. We explore Byzantine Agreement protocols from an energy efficient perspective providing both <i>energy resilience</i> where the actions of the Byzantine nodes can not adversely effect the energy consumption of non-malicious nodes as well as <i>fairness</i> in energy consumption of nodes over multiple rounds of agreement.</p>

of Doctoral Thesis Title: Components and Services in Resource-Constrained Envi- ronments Author: Tomáš Pop tomas.pop@d3s.mff.cuni.cz Department: Department of Distributed and Dependable Systems Faculty of Mathematics and Physics Charles University in Prague Advisor: Prof. František Plášil plasil@d3s.mff.cuni.cz Abstract Appliances of every day use such as consumer electronics, automotive and telecommunication devices as well as various kinds of control systems have be- come a common and important part of our everyday lives. In comparison to general-purpose desktop systems, they are limited in terms of various resources, for example memory, CPU power, and battery capacity. Component-based soft- ware engineering is a well-established development technique, which has found its way to industry and has been successfully used for a long time in multiple do- mains. However, the industrially adopted component frameworks were designed for general-purpose systems and they can be hardly used in resource-constrained environments. In the thesis, we explore the potential of component-based system engineer- ing in resource-constrained environments. Stemming from a survey of existing component frameworks targeted to this domain, we identify the most important approaches to overcome resource constraints in...

No description available.