http://dl.gi.de/handle/20.500.12116/19974 Tue, 21 Jul 2026 13:28:26 GMT 2026-07-21T13:28:26Z http://dl.gi.de:80/bitstream/id/edd085af-c5bb-4d31-9ab8-4c5286a21abe/ http://dl.gi.de/handle/20.500.12116/19974 http://dl.gi.de/handle/20.500.12116/19801 A parallel computing system with specialized coprocessors for cryptanalytic algorithms Kastl, Wolfgang; Loimayr, Thomas Freiling, Felix C. In this paper we present a scalable, parallel computing system consisting of specialized processors primarily designed for the implementation of cryptanalytic algorithms. Even though the system was developed in regard to solve cryptanalytic problems, it is suitable for many other tasks which can benefit from the enormous computing power of the system (e.g. malware analysis). In addition to the use of multi-core CPUs, the computing system takes advantage of graphic cards (GPUs) and FPGAs as specialized coprocessors. Thus, it gains an edge over other conventional parallel computing systems. Fri, 01 Jan 2010 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/19801 2010-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/19802 Towards secure and reliable firewall systems based on MINIX 3 Weis, Rüdiger; Schüler, Brian; Flemming, Stefan A. Freiling, Felix C. Minix 3 is a real micro kernel operation system with a lot of remarkable security features. Two of the main points are size and isolation. The Minix 3 kernel is less than one thousand times the size of Linux. All drivers and the IP stack live in user land. We show a port of the netfilter framework, which leads to a system with better stability and security than the widely used Linux solutions [We07]. Additionally we present some new ideas regarding virtualized systems. Fri, 01 Jan 2010 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/19802 2010-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/19803 A transparent Bridge for forensic sound network traffic data acquisition Kiltz, Stefan; Hildebrandt, Mario; Altschaffel, Robert; Dittmann, Jana Freiling, Felix C. In this paper we introduce a prototype that is designed to produce forensic sound network data recordings using inexpensive hardand software, the Linux Forensic Transparent Bridge (LFTB). It supports the investigation of the network communication parameters and the investigation of the payload of network data. The basis for the LFTB is a self-developed model of the forensic process which also addresses forensically relevant data types and considerations for the design of forensic software using software engineering techniques. LFTB gathers forensic evidence to support cases such as malfunctioning hardand software and for investigating malicious activity. In the latter application the stealthy design of the proposed device is beneficial. Experiments as part of a first evaluation show its usability in a support case and a malicious activity scenario. Effects to latency and throughput were tested and limitations for packet recording analysed. A live monitoring scheme warning about potential packet loss endangering evidence has been implemented. Fri, 01 Jan 2010 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/19803 2010-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/19799 Real-time fault-tolerant routing in high-availability multicast-aware video networks Messmer, Roman; Keller, Jörg Freiling, Felix C. Live-videostream networks based on multimedia switches are the most recent products used in television production and distribution facilities to transport the live signal from sources like cameras or microphones to dedicated sinks like video monitors, loudspeakers and transmission lines. To switch signals from a single source to several destinations multicasting or point-to-multipoint technology is considered. To compute multicast trees for multimedia communication, constrained shortest paths algorithms are needed. They are fundamental to important network functionality such as Quality of Service (QoS) routing or Multiprotocol label switching (MPLS) path selection and the problems they attempt to solve are known to be NP-complete. In previous work, we have introduced a heuristic called Multimedia Multicast algorithm (MulMic), which delivers nearly optimal multicast trees in a short time. Here, we propose the combination of MulMic and two models for fault-tolerant routing: disjoint paths and reservation of backup paths. Furthermore we introduce a realtime algorithm we call ZirkumFlex to handle one or even several simultaneous node or line failures in a multicast network by a local search to bypass the failed node or line. We also apply our algorithm to example graphs to demonstrate its feasibility. Fri, 01 Jan 2010 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/19799 2010-01-01T00:00:00Z