004 Informatik
Refine
Year of publication
Document Type
- Master's Thesis (35)
- Article (3)
- Doctoral Thesis (3)
- Bachelor Thesis (1)
- Conference Proceeding (1)
- Working Paper (1)
Keywords
- .NET Remoting (1)
- .NET-Plattform (1)
- 2 D environment Laser data (1)
- ADO.NET (1)
- ASP.NET (1)
- Active Server Pages (1)
- ActiveX Data Objects (ADO) (1)
- Agenten-Plattform (1)
- Akquisition <Vertrieb> (1)
- Analog-Digital-Umsetzer (1)
The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the McEliece system and a new channel model. With this one Mannheim error channel, errors are limited to weight one. We investigate the channel capacity of this channel and discuss its relation to the McEliece system. The proposed codes are based on a simple product code construction and have a low complexity decoding algorithm. For the one Mannheim error channel, these codes achieve a higher error correction capability than maximum distance separable codes with bounded minimum distance decoding. This improves the work factor regarding decoding attacks based on information-set decoding.
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
(2021)
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem together with the one-Mannheim error channel, where the error values are limited to Mannheim weight one. Due to the limited error values, the codes over Gaussian integers achieve a higher error correction capability than maximum distance separable (MDS) codes with bounded minimum distance decoding. This higher error correction capability improves the work factor regarding decoding attacks based on information-set decoding. The codes also enable a low complexity decoding algorithm for decoding beyond the guaranteed error correction capability. In this work, we extend this coding scheme to codes over Eisenstein integers. These codes have advantages for the Niederreiter system. Additionally, we propose an improved code construction based on generalized concatenated codes. These codes extent the rate region where the work factor is beneficial compared to MDS codes. Moreover, generalized concatenated codes are more robust against structural attacks than ordinary concatenated codes.
Modular arithmetic over integers is required for many cryptography systems. Montgomeryreduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Mont-gomery reduction is used for rings of ordinary integers. In contrast, we investigate the modularreduction over rings of Gaussian integers. Gaussian integers are complex numbers where the real andimaginary parts are integers. Rings over Gaussian integers are isomorphic to ordinary integer rings.In this work, we show that Montgomery reduction can be applied to Gaussian integer rings. Twoalgorithms for the precision reduction are presented. We demonstrate that the proposed Montgomeryreduction enables an efficient Gaussian integer arithmetic that is suitable for elliptic curve cryptogra-phy. In particular, we consider the elliptic curve point multiplication according to the randomizedinitial point method which is protected against side-channel attacks. The implementation of thisprotected point multiplication is significantly faster than comparable algorithms over ordinary primefields.
Flash memories are non-volatile memory devices. The rapid development of flash technologies leads to higher storage density, but also to higher error rates. This dissertation considers this reliability problem of flash memories and investigates suitable error correction codes, e.g. BCH-codes and concatenated codes. First, the flash cells, their functionality and error characteristics are explained. Next, the mathematics of the employed algebraic code are discussed. Subsequently, generalized concatenated codes (GCC) are presented. Compared to the commonly used BCH codes, concatenated codes promise higher code rates and lower implementation complexity. This complexity reduction is achieved by dividing a long code into smaller components, which require smaller Galois-Field sizes. The algebraic decoding algorithms enable analytical determination of the block error rate. Thus, it is possible to guarantee very low residual error rates for flash memories. Besides the complexity reduction, general concatenated codes can exploit soft information. This so-called soft decoding is not practicable for long BCH-codes. In this dissertation, two soft decoding methods for GCC are presented and analyzed. These methods are based on the Chase decoding and the stack algorithm. The last method explicitly uses the generalized concatenated code structure, where the component codes are nested subcodes. This property supports the complexity reduction. Moreover, the two-dimensional structure of GCC enables the correction of error patterns with statistical dependencies. One chapter of the thesis demonstrates how the concatenated codes can be used to correct two-dimensional cluster errors. Therefore, a two-dimensional interleaver is designed with the help of Gaussian integers. This design achieves the correction of cluster errors with the best possible radius. Large parts of this works are dedicated to the question, how the decoding algorithms can be implemented in hardware. These hardware architectures, their throughput and logic size are presented for long BCH-codes and generalized concatenated codes. The results show that generalized concatenated codes are suitable for error correction in flash memories, especially for three-dimensional NAND memory systems used in industrial applications, where low residual errors must be guaranteed.
Fatigue and drowsiness are responsible for a significant percentage of road traffic accidents. There are several approaches to monitor the driver’s drowsiness, ranging from the driver’s steering behavior to analysis of the driver, e.g. eye tracking, blinking, yawning or electrocardiogram (ECG). This paper describes the development of a low-cost ECG sensor to derive heart rate variability (HRV) data for the drowsiness detection. The work includes the hardware and the software design. The hardware has been implemented on a printed circuit board (PCB) designed so that the board can be used as an extension shield for an Arduino. The PCB contains a double, inverted ECG channel including low-pass filtering and provides two analog outputs to the Arduino, that combined them and performs the analog-to-digital conversion. The digital ECG signal is transferred to an NVidia embedded PC where the processing takes place, including QRS-complex, heart rate and HRV detection as well as visualization features. The compact resulting sensor provides good results in the extraction of the main ECG parameters. The sensor is being used in a larger frame, where facial-recognition-based drowsiness detection is combined with ECG-based detection to improve the recognition rate under unfavorable light or occlusion conditions.
Efficient privacy-preserving configurationless service discovery supporting multi-link networks
(2017)
Data is the pollution problem of the information age, and protecting privacy is the environmental challenge — this quotation from Bruce Schneier laconically illustrates the importance of protecting privacy. Protecting privacy — as well as protecting our planet — is fundamental for humankind. Privacy is a basic human right, stated in the 12th article of the United Nations’ Universal Declaration of Human Rights. The necessity to protect human rights is unquestionable. Nothing ever threatened privacy on a scale comparable to today’s interconnected computers. Ranging from small sensors over smart phones and notebooks to large compute clusters, they collect, generate and evaluate vast amounts of data. Often, this data is distributed via the network, not only rendering it accessible to addressees, but also — if not properly secured — to malevolent parties. Like a toxic gas, this data billows through networks and suffocates privacy. This thesis takes on the challenge of protecting privacy in the area of configurationless service discovery. Configurationless service discovery is a basis for user-friendly applications. It brings great benefits, allowing the configurationless network setup for various kinds of applications; e.g. for communicating, sharing documents and collaborating, or using infrastructure devices like printers. However, while today’s various protocols provide some means of privacy protection, typical configurationless service discovery solutions do not even consider privacy. As configurationless service discovery solutions are ubiquitous and run on almost every smart device, their privacy problems affect almost everyone. The quotation aligns very well with configurationless service discovery. Typically, configurationless service discovery solutions realize configurationlessness by using cleartext multicast messages literally polluting the local network and suffocating privacy. Messages containing private cleartext data are sent to everyone, even if they are only relevant for a few users. The typical means for mitigating the network pollution problem caused by multicast per se, regardless of the privacy aspects, is confining multicast messages to a single network link or to the access network of a WiFi access point; institutions often even completely deactivate multicast. While this mitigates the privacy problem, it also strongly scales configurationless service discovery down, either confining it or rendering it completely unusable. In this thesis, we provide an efficient configurationless service discovery framework that protects the users’ privacy. It further reduces the network pollution by reducing the number of necessary multicast messages and offers a mode of operation that is completely independent of multicast. Introducing a multicast independent mode of operation, we also address the problem of the limited range in which services are discoverable. Our framework comprises components for device pairing, privacy-preserving service discovery, and multi-link scaling. These components are independent and — while usable in a completely separated way — are meant to be used as an integrated framework as they work seamlessly together. Based on our device pairing and privacy-preserving service discovery components, we published IETF Internet drafts specifying a privacy extension for DNS service discovery over multicast DNS, a wildly used protocol stack for configurationless service discovery. As our drafts have already been adopted by the dnssd working group, they are likely to become standards.
Cyberspace: a world at war. Our privacy, freedom of speech, and with them the very foundations of democracy are under attack. In the virtual world frontiers are not set by nations or states, they are set by those, who control the flows of information. And control is, what everybody wants.
The Five Eyes are watching, storing, and evaluating every transmission. Internet corporations compete for our data and decide if, when, and how we gain access to that data and to their pretended free services. Search engines control what information we are allowed - or want - to consume. Network access providers and carriers are fighting for control of larger networks and for better ways to shape the traffic. Interest groups and copyright holders struggle to limit access to specific content. Network operators try to keep their networks and their data safe from outside - or inside - adversaries.
And users? Many of them just don’t care. Trust in concepts and techniques is implicit. Those who do care try to take back control of the Internet through privacy-preserving techniques.
This leads to an arms race between those who try to classify the traffic, and those who try to obfuscate it. But good or bad lies in the eye of the beholder, and one will find himself fighting on both sides.
Network Traffic Classification is an important tool for network security. It allows identification of malicious traffic and possible intruders, and can also optimize network usage. Network Traffic Obfuscation is required to protect transmissions of important data from unauthorized observers, to keep the information private. However, with security and privacy both crumbling under the grip of legal and illegal black hat crackers, we dare say that contemporary traffic classification and obfuscation techniques are fundamentally flawed. The underlying concepts cannot keep up with technological evolution. Their implementation is insufficient, inefficient and requires too much resources.
We provide (1) a unified view on the apparently opposed fields of traffic classification and obfuscation, their deficiencies and limitations, and how they can be improved. We show that (2) using multiple classification techniques, optimized for specific tasks improves overall resource requirements and subsequently increases classification speed. (3) Classification based on application domain behavior leads to more accurate information than trying to identify communication protocols. (4) Current approaches to identify signatures in packet content are slow and require much space or memory. Enhanced methods reduce these requirements and allow faster matching. (5) Simple and easy to implement obfuscation techniques allow circumvention of even sophisticated contemporary classification systems. (6) Trust and privacy can be increased by reducing communication to a required minimum and limit it to known and trustworthy communication partners.
Our techniques improve both security and privacy and can be applied efficiently on a large scale. It is but a small step in taking back the Web.
Die vorliegende Arbeit untersucht, wie Tools für die Überprüfung von Quell-Code auf Konformität mit Programmierstilen, die komplexere Entwurfsmuster beinhalten, als Erweiterung des statischen CodeAnalyse-Tools Checkstyle realisiert werden können. Als Beispiel wird der Joi Programmierstil verwendet, der für diese Arbeit aus der Java Spracherweiterung Joi (Java Objects by Interfaces), die die Einhaltung einiger Entwurfsmuster, die auf die Reduzierung von Code-Abhängigkeiten zielen, unterstützt, abgeleitet wurde.
Die Firma FCT bietet industriellen Unternehmen eine Lösung im Bereich Enterprise-Content-Management und Redaktionssysteme an. Der Fokus liegt auf der medienneutralen Verwaltung der Daten im XML-Format und auf dem Publizieren dieser Daten in verschiedene Ausgabeformate wie PDF, HTML oder Online Help. Die Publikation nach PDF erfolgt meistens mit Desktop Publishing Tools wie Adobe FrameMaker, Adobe InDesign oder Microsoft Word. Immer mehr wird die Publikation nach PDF mit dem W3C Standard XSL Formatting Objects (XSL-FO)eingesetzt. Die Publikation nach PDF erfolgt dabei vollautomatisch anhand von Stylesheets. Durch die vollautomatische Publikation hatte der Redakteur bisher keine Möglichkeit manuell Seitenlayout und Seitenformatierungen anzupassen, da das Anpassen der Stylesheets spezielles programmiertechnisches Know-How voraussetzt. Im Rahmen dieser Diplomarbeit wurde eine Entwicklungsumgebung konzipiert und implementiert, die es Redakteuren ermöglicht, Seitenlayout und Seitenformatierung komfortabel über eine grafische Oberfläche festzulegen. Da hierbei unterschiedliche Dokumententypen und unterschiedliche Kunden berücksichtigt werden müssen, verwendet die Anwendung ein Projektansatz um die unterschiedlichen Stylesheets, Konfigurationen und Kunden zu organisieren. Da bei unterschiedlichen Kunden verschiedene FO-Prozessoren wie Antenna House XSL Formatter, RenderX XEP oder Apache FOP zum Einsatz kommen, war es ein Schwerpunkt dieser Arbeit, die Unterschiede dieser Prozessoren zu analysieren und die Entwicklungsumgebung prozessorunabhängig aufzusetzen. Eine Vorschau zeigt dem Redakteur, wie sich die verschiedenen Konfigurationen auf das PDF-Dokument auswirken, um gegebenenfalls weitere Änderungen am Seitenlayout bzw. Seitenformatierungen vorzunehmen.
Anbindung eines PPC405 embedded CPU Core an ein MPC860-System unter dem Echtzeitbetriebssystem OSE
(2006)
Die Diplomarbeit verfolgt das Ziel, die softwareseitige Anbindung eines PPC405-Systems an das Gesamtsystem einer digitalen Funkgeräteplattform herzustellen. Über eine konzipierte Implementierung, die nach dem Einschalten des Funkgeräts gestartet wird, erfolgt die Übertragung des Betriebssystems in den zugehörigen Arbeitsspeicher des PPC405-Systems. Nach Abschluss der Initialisierungsphase kommunizieren die Anwendungsprozesse auf den beteiligten Systemen über eine transparente Erweiterung des Betriebssystems mit der jeweiligen Gegenseite. Als Übertragungsmedium für die genannte Betriebssystemerweiterung wird ein zwischen den Systemen angesiedelter Speicher genutzt, für dessen koordinierte Zugriffe eine im Rahmen der Diplomarbeit entwickelte Treiberkomponente sorgt. Durch die Anbindung des PPC405-Systems wird eine Leistungssteigerung des Gesamtsystems erwartet. Auf der Basis von Messungen wurde die Performance des somit erhaltenen Multiprozessorsystems bestimmt. Aus den Ergebnissen wurden geeignete Möglichkeiten zur Optimierung erarbeitet und umgesetzt.
