The objective of this dissertation is to develop a methodology for describing the functionality, analyzing the complexity, and evaluating the performance of a large class of pattern-matching circuit design approaches for field-programmable gate arrays (FPGAs). The developed methodology consists of three elements. The first is a functional model and associated nomenclature that unifies a significant portion of published circuit design approaches while also illuminating many novel approaches. The second is a set of analytical expressions that model the area and time complexity of each circuit design approach based on attributes of a given pattern set. Third, software tools are developed that facilitate architectural design space exploration and circuit implementation. This methodology is used to conduct an extensive evaluation and comparison of design approaches under a wide range of conditions using pattern sets from multiple application domains as well as synthetic pattern sets. The results indicate strong dependences between pattern set properties and circuit performance and provide new insights on the fundamental nature of various design approaches. A number of techniques have been proposed for designing pattern-matching hardware circuits with reconfigurable FPGA chips. The use of FPGAs enables high performance because the circuits can be customized for a particular application and pattern set. A relatively unstudied consequence of tailoring circuits for specific patterns is that circuit area and performance are affected by various properties of the patterns used. Most previous work in this field only considers a single design approach and a small number of pattern sets. Therefore, it is not clear how each design is affected by pattern set properties. For a given set of patterns, it is difficult to determine which approach would be the most efficient or provide the highest performance. Previous attempts to compare approaches using results from different publications are conflicting and inconclusive due to variations in the FPGA devices, patterns, and circuit optimizations used. There has been no attempt to evaluate a wide range of designs under a common set of conditions. The methodology presented in this dissertation provides a framework for studying multiple aspects of FPGA pattern-matching circuits in a controlled and consistent manner.

I en tid då datorer, mobiler och andra enheter som kan ansluta till ett WLAN är stor, kommer säkerheten i dessa WLAN spela en stor roll. Det som skiljer WLAN och LAN när det kommer till säkerheten är att informationen måste färdas trådlöst i luften, vilket kan medföra att obehöriga kan lyssna av eller försöka koppla upp sig mot det trådlösa nätverket. Valet och implementationen av kryptering av WLAN för SME och privatpersoner har en stor inverkan på säkerheten i ens WLAN. Hur enkelt är det för en obehörig person att ta sig in på ett WLAN? Denna undersökning testar WLAN som använder WEP, WPA/WPA2 PSK och WPS med hjälp av en brute force attack för att avgöra om krypteringprotokollen är lämpliga att använda sig av. Testet simuleras med en obehörig laptop som försöker ta sig in in WLAN med brute force på WLAN som använder WEP, WPA/WPA2 PSK och WPS. Program som aircrack-ng och airgeddon används för att utföra testerna.

This document was created in addition to a recital for the seminar Pattern Matching at Chemnitz University of Technology in term 2001/2002. It is a description of basic text search approaches, which are the algorithms of Brute Force, Knuth-Morris-Pratt, Boyer-Moore and Boyer-Moore-Horspool. / Dieses Dokument entstand parallel zu einem Vortrag für das Proseminar Pattern Matching im Wintersemester 2001/2002 an der Technischen Universität Chemnitz. Es stellt die Funktionsweise der grundlegenden Suchalgorithmen Brute Force, Knuth-Morris-Pratt, Boyer-Moore sowie Boyer-Moore-Horspool dar.

This report is the result of a sub-project of a larger project to create a platform formathematical education. The sub-project focuses on authentication with associ-ated security, where security is emphasized. The project environment is Java EE 6where GlassFish 4.0 acts as the server. The project has been divided into threeparts; password encryption, Java EE authentication and brute force attack. Thepassword encryption part focuses on examining different hash functions executionspeed, the result shows that none of the examined hash algorithms is suitable fordirect use. Instead its recommended to use PBKDF2 with salt to encrypt pass-words. The Java EE section constructs a working application where users can reg-ister and login etc. This is performed as a study of the security tools available inJava EE. The result meets the requirement specification and a section on Java EEsecurity tools is presented. The brute force attack section is a theoretical study ofwhat can be done to protect against a brute force attack. The result shows thatCAPTCHAs is not recommended by OWASP and a system using cookies and aform of userblocking is purposed. The various parts are separated as far as possi-ble through the report with the exception that the result of the password encryp-tion section is applied in the Java EE application. / Denna rapport är resultatet av en deluppgift i ett större projekt att skapa en platt-form för undervisning av matematik. Uppgiften fokuserar på inloggning med till-hörande säkerhet. Projektets miljö är Java EE 6 med Glassfish 4.0 som server.Projektet har delats upp i tre underkategorier; Lösenordskryptering, Java EE in-loggning och Brute force attacks. Lösenordskrypterings delen fokuserar på att un-dersöka olika hashfunktioners exekveringshastighet, resultatet visar att ingen avde algoritmer som undersöks lämpar sig att användas direkt. Istället rekommende-ras system som PBKDF2 med SALT för att kryptera lösenord. Java EE avsnittetkonstruerar en fungerande applikation där användare kan registrera sig och loggain med mera. Arbetet utförs som en studie av vilka säkerhetsverktyg som finnstillgängliga i Java EE. Resultatet uppfyller kravspecifikationen och ett avsnitt omJava EEs verktyg presenteras. Brute force attack-avsnittet är en teoretisk studieav vad som kan göras för att skydda sig mot Brute force attacker. Resultatet visaratt robotfilter inte är rekommenderat av OWASP och ett förslag på ett system somanvänder kakor och en form av användarblockering presenteras. De olika delarnaär separerade så långt som möjligt genom rapporten med undantaget att resultatetav lösenordskrypterings avsnittet tillämpas i Java EE applikationen.

Detta examensarbete är en utvärdering av nätverkssäkerheten hos J BiL AB, både på social och teknisk nivå. Företaget är beroende av säkra Internet-anslutningar för att nå externa tjänster och interna servrar lokaliserade på olika geografiska platser. Företaget har ingen IT-ansvarig som aktivt underhåller och övervakar nätverket, utan konsulterar ett externt dataföretag. Syftet med examensarbetet är att utvärdera säkerheten, upptäcka brister, ge förbättringsförslag och till viss del implementera lösningar. För att undersöka säkerheten har observationer och intervjuer med personalen gjorts och ett flertal attacker mot nätverket har utförts. Utifrån den data som samlats in kunde slutsatsen dras att företaget har brister vad gäller IT-säkerheten. Framförallt den sociala säkerheten visade sig ha stora luckor vilket till stor del beror på att de anställda varken har blivit utbildade eller fått någon information om hur de ska hantera lösenord, datorer och IT-frågor i allmänt. Förbättringsförslag har getts och viss implementation har genomförts för att eliminera bristerna. De anställda har även med hjälp av en IT-policy och föreläsning blivit utbildade i hur de ska agera och tänka kring IT-relaterade säkerhetsfrågor. / The aim of this project is to evaluate the network security at J Bil AB. The focus will be on both social and technical issues. For the employees to be able to con-nect to remote servers and external services and perform their daily work tasks, secure connections is needed. J Bil Ab has no IT manager who actively maintains and monitors the network; rather they consult a computer company when changes and implementations are required. The projects’ goal is to identify gaps, come up with suggestions for improvement and to some extent implement so-lutions. To do this, an observation of the employees hav been made, an inter-view have been held, and several attacks on the network have been performed. Based on the data collected, it was concluded that the company has shortcom-ings in IT security. Above all, the social security appeared to have major gaps in it and that is mainly because the lack of knowledge among the employees and they have never been informed of how to manage their passwords, computers and IT issues in general. Suggestions for improvement have been given and some implementations have been performed to eliminate the deficiencies.

This document was created in addition to a recital for the seminar Pattern Matching at Chemnitz University of Technology in term 2001/2002. It is a description of basic text search approaches, which are the algorithms of Brute Force, Knuth-Morris-Pratt, Boyer-Moore and Boyer-Moore-Horspool. / Dieses Dokument entstand parallel zu einem Vortrag für das Proseminar Pattern Matching im Wintersemester 2001/2002 an der Technischen Universität Chemnitz. Es stellt die Funktionsweise der grundlegenden Suchalgorithmen Brute Force, Knuth-Morris-Pratt, Boyer-Moore sowie Boyer-Moore-Horspool dar.

The work deals with the resistance of the VeriFinger comparison algorithm to synthetic fingerprints. The basics of fingerprints, comparison algorithms and synthetic fingerprint generators are gradually analyzed. In total, three experiments were designed to test the resistance of the algorithm using synthetic fingerprints. An application using the VeriFinger algorithm was implemented to evaluate individual experiments. A total of 2 800 000 synthetic fingerprints were generated across all experiments. The first experiment showed that random fingerprint generation was not effective for real fingerprints, but was somewhat sufficient for synthetic fingerprints. The second experiment proved that comparison and the comparison score could be used to estimate the class of the identified fingerprint, and in the third experiment, by narrowing the generation to one class, it raised the total number of matched fingerprints. The results of individual experiments were written and their possible extension was suggested.

This master thesis deals with ways to store passwords in current operating systems. Specifically, this work focuses on Windows, Linux, BSD and OS X. These systems are examined for ways of hashing passwords and on resistance of resulting hashes against various attacks. First (theoretical) section describes the procedures and algorithms that are needed for user authentication. This part also describes methods of hash storing. At the end of the theoretical part are generally described some possible attacks against hash functions. In second (practical) part is described and tested tools for obtaining hashes of the investigated operating systems. Subsequently practical attacks were conducted against obtained hashes by using appropriate tools. Furthermore there are presented results of the attacks. In the conclusion of the work there is a comparison of tools and methods which were used to obtain plaintext passwords from operating systems.

This project deals with analysis of brute force attacks focused on breaking authentication of common services (especially ssh) of Linux and xBSD operating systems. It also examines real attacks, actual tools and ways of detection of theese attacks. Finaly there are designed new mechanisms of coordination and evaluation of distributed brute force attacks in distributed environment. These mechanisms are then implemented in distributed system called DBFAP.

På grund av Covid 19 har de flesta människor valt att jobba hemifrån och de flesta hushåll har en accesspunkt som möjliggör kommunikation mellan flera enheter. Attacker mot Wi-Fi accesspunkter har ökat under de senaste åren på grund av sårbarheter som kan finnas i accesspunkten. När en sårbar väg hittas i accesspunkt kan detta ledda till att angriparen använder den sårbara vägen för att göra ett intrång och skada en eller flera enheter i hemnätverket och även företagens enheter. Teknikens framsteg har hjälpt oss att implementera flera säkerhetsåtgärder som kan skydda accesspunkten vid intrångsförsök. Syftet med detta arbete är att lägga fokus på att ge rätt kunskap för nya nätverkstekniker för att öka medvetenhet inom säkerheten i hemnätverk. Målet med detta examensarbete är att ge en djupare kunskap för nya nätverkstekniker för att kunna förhindra eller minimera attacker som orsakas av sårbarheter i ett hemnätverk med Wi-Fi accesspunkt och ta fram en rutin för hur det ska skyddas. Efter vi har identifierat en mängd attacker och själva utfört dem, visade resultatet att det var lätt att manipulera en sårbar accesspunkt med de valda attacksverktygen i detta arbete och experimenten har påvisat oss vikten av att implementera rätt säkerhetsåtgärder och hur väl de skyddar accesspunkten mot ett intrångsförsök. / Due to Covid 19, most people have chosen to work from home and most households have an access point that enables communication between several devices. Attacks against Wi-Fi access points have increased in recent years due to vulnerabilities that may exist in the access point. When a vulnerable path is found in the access point, this can lead to the attacker using the vulnerable path to breach and damage one or more devices in the home network and even corporate devices. Advances in technology have helped us implement several security measures that can protect the access point in case of intrusion attempts. The purpose of this work is to focus on providing the right knowledge for new network technicians to increase awareness in home network security. The goal of this thesis is to provide a deeper knowledge for new network technicians to be able to prevent or minimize attacks caused by vulnerabilities in a home network with a Wi-Fi access point and develop a routine for how to protect it. After we have identified several attacks and performed it ourselves, the result showed that it was easy to manipulate a vulnerable access point with the selected attack tools in this work and the experiments have shown us the importance of implementing the right security measures and how well they protect the access point against an intrusion attempt.