Οι κρυπτογραφικές συναρτήσεις κατακερματισμού αποτελούν στις μέρες μας ένα από τα δημοφιλέστερα συστατικά των κρυπτογραφικών συστημάτων, λόγω των ιδιαίτερων ιδιοτήτων τους. Λαμβάνοντας υπόψη τη συνεχή αύξηση του όγκου δεδομένων και των ταχυτήτων επικοινωνίας, η χρήση μιας συνάρτησης κατακερματισμού με χαμηλή ρυθμοαπόδοση μπορεί να επιβραδύνει το συνολικό ψηφιακό τηλεπικοινωνιακό σύστημα. Ο σχεδιασμός ενός δεδομένου αλγορίθμου κατακερματισμού ώστε να έχει τη βέλτιστη ρυθμοαπόδοση αποτελεί ζήτημα μεγάλης σημασίας. Στη συγκεκριμένη διπλωματική εργασία παρουσιάζεται μια μεθοδολογία σχεδιασμού με στόχο τη βέλτιστη ρυθμοαπόδοση κρυπτογραφικών αλγορίθμων που βασίζονται σε συγκεκριμένη επαναληπτική μορφή. Για το σκοπό αυτό αναπτύχθηκε ένα λογισμικό, που συνδυάζει δύο τεχνικές, τον επαναχρονισμό και την ξεδίπλωση, παράγοντας το βέλτιστο σχεδιαστικό αποτέλεσμα. Η μεθοδολογία εφαρμόστηκε σε δύο δημοφιλείς συναρτήσεις κατακερματισμού, τις SHA-1 και SHA-256. Οι μετασχηματισμένοι αλγόριθμοι συνθέθηκαν και υλοποιήθηκαν σε FPGA, επιβεβαιώνοντας την αποτελεσματικότητα της μεθόδου. / Nowadays, cryptographic hash functions are one of the most popular primitive components in the cryptographic systems, due to their key features. Considering that data sizes and communication speeds are increasing every year, the use of a hash algorithm with low throughput can be a bottle neck in the digital communication system. Designing a given hash algorithm to be throughput optimum is a critical issue. In this diploma thesis a design methodology is presented which oprimizes the throughput of cryptographic hash functions that rely on a specific iterative structure. For this purpose, a software was designed combining two techniques, retiming and unfolding, that generates the optimal throughput design. The methodology was applied to two popular hash algorithms, SHA-1 and SHA-256. The transformed algorithms were synthesized and implemented in a FPGA device, confirming its effectiveness.

Title: Binary Signed Digit Representations of Integers in Cryptanalysis of Hash Functions Author: Jiří Vábek Department: Department of Algebra Supervisor: doc. RNDr. Jiří Tůma, DrSc., Department of Algebra Abstract: The work summarizes two main papers, A New Type of 2-block Colli- sions in MD5 and On the Number of Binary Signed Digit Representations of a Given Weight, while containing also the wider introduction to the topic of crypt- analysis of MD5 and binary signed digit representations (BSDR's). In the first paper we have implemented and applied Stevens algorithm to the newly proposed initial message differences and constructed a new type of collisions in MD5. In the second paper we have introduced and proved a new improved bound for the number of optimal BSDR's and also a new recursive bound for the number of BSDR's of a given integer with a given overweight. In addition to the results in mentioned papers, the generalized result is stated with the new bound for the number of optimal D-representations of natural numbers with D = {0, 1, 3}. Keywords: hash function, MD5, binary signed digit representation (BSDR), non- adjacent form (NAF) 1

abstract: Modern software and hardware systems are composed of a large number of components. Often different components of a system interact with each other in unforeseen and undesired ways to cause failures. Covering arrays are a useful mathematical tool for testing all possible t-way interactions among the components of a system. The two major issues concerning covering arrays are explicit construction of a covering array, and exact or approximate determination of the covering array number---the minimum size of a covering array. Although these problems have been investigated extensively for the last couple of decades, in this thesis we present significant improvements on both of these questions using tools from the probabilistic method and randomized algorithms. First, a series of improvements is developed on the previously known upper bounds on covering array numbers. An estimate for the discrete Stein-Lovász-Johnson bound is derived and the Stein- Lovász -Johnson bound is improved upon using an alteration strategy. Then group actions on the set of symbols are explored to establish two asymptotic upper bounds on covering array numbers that are tighter than any of the presently known bounds. Second, an algorithmic paradigm, called the two-stage framework, is introduced for covering array construction. A number of concrete algorithms from this framework are analyzed, and it is shown that they outperform current methods in the range of parameter values that are of practical relevance. In some cases, a reduction in the number of tests by more than 50% is achieved. Third, the Lovász local lemma is applied on covering perfect hash families to obtain an upper bound on covering array numbers that is tightest of all known bounds. This bound leads to a Moser-Tardos type algorithm that employs linear algebraic computation over finite fields to construct covering arrays. In some cases, this algorithm outperforms currently used methods by more than an 80% margin. Finally, partial covering arrays are introduced to investigate a few practically relevant relaxations of the covering requirement. Using probabilistic methods, bounds are obtained on partial covering arrays that are significantly smaller than for covering arrays. Also, randomized algorithms are provided that construct such arrays in expected polynomial time. / Dissertation/Thesis / Doctoral Dissertation Computer Science 2016

MediaSense is an EU funded platform that is an implementation of an Internet-of-Things framework. This project adds two fundamental functions to it, namely, a new lookup service based on a peer-to-peer Distributed Hash Table (DHT) called Chord and a reliable communication protocol based on UDP (RUDP). The lookup service makes the use of a central server, that can be a single point of failure or get compromised, unnessecary. Reliable UDP transmits data from the very first packet onwards and avoids any connection management as itis packet based. The methodology for both functions was to develop a simulation environment, compatible to MediaSense, at its initiation, at which point its functionality can be tested and measurements can betaken. The resulting DHT simulation environment enables there to be deep insight into and a control of the state and action of the DHT. The resulting graphs show the performance properties of both the DHT and RUDP. In conclusion, the MediaSense platform has been extended by means of two usable functionalities and which also leaves space for further development such as for security enhancements and performance increases. / MediaSense

De nombreux systèmes distribués sont confrontés au problème du déséquilibre de charge entre machines. Avec l'émergence du Big Data, de larges volumes de données aux valeurs souvent biaisées sont produits par des sources hétérogènes pour être souvent traités en temps réel. Il faut donc être capable de s'adapter aux variations de volume/contenu/provenance de ces données. Nous nous intéressons ici aux données RDF, un format du Web Sémantique. Nous proposons une nouvelle approche pour améliorer la répartition des données, basée sur l'utilisation de plusieurs fonctions de hachage préservant l'ordre naturel des données dans le réseau. Cela permet à chaque pair de pouvoir indépendamment modifier la fonction de hachage qu'il applique sur les données afin de réduire l'intervalle de valeurs dont il est responsable. Plus généralement, pour résoudre le problème du déséquilibre de charge, il existe presque autant de stratégies qu'il y a de systèmes différents. Nous montrons que de nombreux dispositifs d'équilibrage de charge sont constitués des mêmes éléments de base, et que seules la mise en œuvre et l'interconnexion de ces éléments varient. Partant de ce constat, nous décrivons les concepts derrière la construction d'une API générique pour appliquer une stratégie d'équilibrage de charge qui est indépendante du reste du code. Mise en place sur notre système, l'API a un impact minimal sur le code métier et permet de changer une partie d'une stratégie sans modifier d'autres composants. Nous montrons aussi que la variation de certains paramètres peut influer sur les résultats obtenus. / Many distributed systems face the problem of load imbalance between machines. With the advent of Big Data, large datasets whose values are often highly skewed are produced by heterogeneous sources to be often processed in real time. Thus, it is necessary to be able to adapt to the variations of size/content/source of the incoming data. In this thesis, we focus on RDF data, a format of the Semantic Web. We propose a novel approach to improve data distribution, based on the use of several order-preserving hash functions. This allows an overloaded peer to independently modify its hash function in order to reduce the interval of values it is responsible for. More generally, to address the load imbalance issue, there exist almost as many load balancing strategies as there are different systems. We show that many load balancing schemes are comprised of the same basic elements, and only the implementation and interconnection of these elements vary. Based on this observation, we describe the concepts behind the building of a common API to implement any load balancing strategy independently from the rest of the code. Implemented on our distributed storage system, the API has a minimal impact on the business code and allows the developer to change only a part of a strategy without modifying the other components. We also show how modifying some parameters can lead to significant improvements in terms of results.

The Internet of Things (IoT) is a vision that aims at inter-connecting every physical identifiable object (or, a thing) via a global networking infrastructure (e.g., the legacy Internet). Several architectures are proposed to realize this vision; many of which agree that the IoT shall be considered as a global network of networks. These networks are used to manage wireless sensors, Radio Frequency IDentification (RFID) tags, RFID readers and other types of electronic devices and integrate them into the IoT. A major requirement of the IoT architectures is scalability, which is the capability of delivering high performance even if the input size (e.g., number of the IoT objects) is large. This thesis studies and proposes solutions to meet this requirement, and specifically focuses on the scalability issues found in the networks of the IoT. The thesis proposes several network formation algorithms to achieve these objectives, where a network formation algorithm is an algorithm that, if applied to a certain network, optimizes it to perform its tasks in a more efficient manner by virtually deleting some of its nodes and/or edges. The thesis focuses on three types of networks found in the IoT: 1) RFID readers coverage networks; whose main task is to cover (i.e., identify, monitor, track, sense) IoT objects located in a given area, 2) readers inter-communications networks; whose main task is to guarantee that their nodes are able to inter-communicate with each other and hence use their resources more efficiently (the thesis specifically considers inter-communication networks of readers using Bluetooth for communications), and 3) Object Name Systems (ONS) which are networks of several inter-connected database servers (i.e., distributed database) whose main task is to resolve an object identifier into an Internet address to enable inter-communication via the Internet. These networks are chosen for several reasons. For example, the technologies and concepts found in these networks are among the major enablers of the IoT. Furthermore, these networks solve tasks that are central to any IoT architecture. Particularly, the thesis a) studies the data and readers redundancy problem found in RFID readers coverage networks and introduces decentralized RFID coverage and readers collisions avoidance algorithms to solve it, b) contributes to the problem of forming multihop inter-communications networks of Bluetooth-equipped readers by proposing decentralized time-efficient Bluetooth Scatternet Formation algorithms, and c) introduces a geographic-aware ONS architecture based on Peer-To-Peer (P2P) computing to overcome weaknesses found in existing ONS architectures.

La industria de la acuicultura se está expandiendo debido a la demanda de alimentos por el crecimiento de la población. En 2019, en España, la producción alcanzó 342.867 toneladas y un valor de primera venta de 501 millones de euros (APROMAR 2020). Las principales especies producidas fueron los mejillones (77%), la lubina (8%) y la dorada (4%), todas especies cultivadas en zonas costeras. Las principales estructuras donde se cultivaban estas especies son bateas y long lines para mejillones (4.793 instalaciones) y jaulas flotantes para lubina y dorada (43 instalaciones) (APROMAR 2020). Ambos cultivos producen enriquecimiento por MO y acumulación de restos de valva de mejillón en los sedimentos marinos. Sin embargo, existe una falta de conocimiento para poder entender todas las consecuencias ecológicas de la interacción entre el enriquecimiento por MO y la acumulación de valvas de mejillón en los ecosistemas bentónicos, ya que aunque se ha estudiado en profundidad el efecto del enriquecimiento por MO sobre los sedimentos (Holmer et al. 2005a; Apostolaki et al. 2007; Holmer et al. 2007), los efectos de acumulación los restos de valva de mejillón en los ecosistemas de sedimentos apenas se han investigado (Newell 2004; Wilding 2012; Wilding and Nickell 2013). Por lo tanto, para mejorar el conocimiento de los impactos de la acuicultura y sus interacciones en los sedimentos, los objetivos generales de la presente tesis doctoral han sido: Capítulo 2) Analizar el efecto de la bioturbación en la capacidad metabólica de los sedimentos a lo largo de un gradiente de enriquecimiento por MO derivado de la acuicultura marina. Capítulo 3) Investigar la interacción entre el enriquecimiento por valva de mejillón y por MO derivado de la acuicultura en flujos biogeoquímicos de sedimentos marinos. Capítulo 4) Comprobar el efecto del enriquecimiento por valva de mejillón y por MO procedente de la acuicultura en la capacidad de bioturbación de la comunidad de la macrofauna de los sedimentos marinos. Las principales conclusiones de esta tesis son: 1. Los sedimentos bioturbados, al promover las condiciones óxicas, pueden amortiguar las consecuencias negativas relacionadas la limitación de oxígeno producidas por el aporte extra de materia orgánica de la actividad acuícola. 2. La prevalencia de condiciones óxicas a través de la bioturbación de la macrofauna puede disminuir la importancia de las vías anaeróbicas de mineralización de la materia organica del sedimento bajo la influencia de la acuicultura, limitando la capacidad metabólica del sedimento. 3. En sedimentos bioturbados, su capacidad metabólica puede no seguir una relación lineal con el nivel de enriquecimiento por materia orgánica derivado de la actividad acuícola, aumentando la acumulación de contenido de MO en el sedimento a altas tasas de aporte de la materia orgánica. 4. Analizar la capacidad metabólica de los sedimentos podría ser una herramienta relevante para predecir la respuesta de los sedimentos frente al enriquecimiento de materia orgánica de los sistemas de acuicultura. 4. El análisis de la capacidad metabólica de los sedimentos puede ser una herramienta relevante para predecir la respuesta de los sedimentos frente al enriquecimiento por materia orgánica derivada de la acuicultura. 5. Los restos de valva de mejillón procedentes de los sistemas acuícolas sobre sedimentos arenosos sin macrofauna, en condiciones de enriquecimiento por materia orgánica, pueden disminuir la tasa de liberación de amonio a la columna de agua, limitando las consecuencias ecológicas negativas derivadas de la eutrofización. 6. Los restos de valva de mejillón, procedentes de los sistemas acuícolas, en sedimentos arenosos contaminados por materia orgánica pueden reducir la acumulación de los subproductos de vías metabólicas anaeróbicas, mejorando el estado ecológico del sedimento impactado. 7. Los restos de valva de mejillón, procedentes de los sistemas acuícolas, pueden modificar la comunidad de la macrofauna de los sedimentos arenosos en áreas oligotróficas, triplicando su abundancia y biomasa, y promoviendo la abundanica de familias con mayor capacidad de bioturbación, específicamente las familias Nassaridae y Nereididae. El efecto de los restos de valva de mejillón en la comunidad de la macrofauna bentónica está modulado por las características del sedimento, específicamente por el tamaño del grano y el contenido natural de materia orgánica. No se han obtenido efectos negativos significativos de los restos de valva de mejillón sobre la comunidad de sedimentos macrofaunales y sobre sus parámetros fisicoquímicos. 10. Los restos de valva de mejillón procedentes de los sistemas acuícolas, que suelen tratarse como un producto de desecho, podrían utilizarse para mitigar los efectos negativos de la contaminación por materia orgánica en los sedimentos marinos, particularmente en sitios defaunados. 11.Mantener los restos de conchas de mejillón derivados del sistema de acuicultura en sedimentos arenosos podría beneficiar la capacidad de bioturbación de la comunidad de la macrofauna que podría mejorar el metabolismo aeróbico de los sedimentos, reduciendo el coste de su gestión de extracción del sedimento y previniendo las posibles perturbaciones asociadas. / La parte experimental de la presente tesis doctoral ha sido costeada por el proyecto del Ministerio de Ciencia, Innovación y Universidades títulado "IMPLICACIONES ECOLOGICAS DE FONDOS MARINOS BIOGENICOS ARTIFICIALES: ACUMULOS DE RESTOS DE BIVALVOS COMO HERRAMIENTA DE MITIGACION ORGANICA Y SUMIDERO DE CARBONO" (CGL2015-70136-R).

Digital signatures are widespread in IT nowadays. In some cases there is emphasized the security of signer identity when signing an electronic message. For this type of signature group digital signatures are suitable. In this thesis basic cryptographic functions are presented which are used for group digital signatures. The principle of group signatures is explained, its advantages and nowadays use. Further are explained electronic election and it dis- and advantages. The practical part is a design and implementation of system suitable for electronic election allowing anonymity of voters using group digital signatures.

This work describes one - way hash functions and cryptographic algorithms . It also describes their implementation regarding DOC, PDF and ZIP files contents encryption . Subsequently , the implementation analyzis is provided . Following next, the brute - force attack procedure levereging GPU is proposed and evaluated.

This thesis deals with design and implementation of mapping of match action tables from P4 language to FPGA technology. Goal of the thesis was to describe key principles, which need to be understood in order to design such a mapping and function of algorithms needed, apply these principles by implementing them and analyze the speed and memory requirements of such an implementation. Outcome provides configurable hardware unit capable of classifying packets and connection between the unit and match action tables from P4 language. The implementation is based on DCFL algorithm and requires less memory compared to HiCuts and HyperCuts algorithms while being comparably fast at worst-case scenarios.