Sökning: "Optimal Attacks"
Visar resultat 1 - 5 av 27 uppsatser innehållade orden Optimal Attacks.
1. Comparing machine learning algorithms for detecting behavioural anomalies
Uppsats för yrkesexamina på avancerad nivå, Blekinge Tekniska Högskola/Institutionen för datavetenskapSammanfattning : Background. Attempted intrusions at companies, either from an insider threat orotherwise, is increasing in frequency. Most commonly used is static analysis and filters to stop specific attacks. LÄS MER
2. Skillnader mellan granindivider gällande initieringsfrekvens för somatisk embryogenes
Kandidat-uppsats, SLU/School for Forest ManagementSammanfattning : Gran (Picea abies) har länge varit ett viktigt trädslag för den svenska skogsnäringen. Skogsbruket står inför en oviss framtid och med ett alltmer ostadigt klimat behövs ett genetiskt material som kan klara dessa nya prövningar. LÄS MER
3. Determining the Optimal Frequencies for a Duplicated Randomized Clock SCA Countermeasure
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Side-channel attacks pose significant challenges to the security of embedded systems, often allowing attackers to circumvent encryption algorithms in minutes compared to the trillions of years required for brute-force attacks. To mitigate these vulnerabilities, various countermeasures have been developed. LÄS MER
4. Exploring the Viability of PageRank for Attack Graph Analysis and Defence Prioritization
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : In today's digital world, cybersecurity is becoming increasingly critical. Essential services that we rely on every day such as finance, transportation, and healthcare all rely on complex networks and computer systems. LÄS MER
5. Analysis of Flow Prolongation Using Graph Neural Network in FIFO Multiplexing System
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Network Calculus views a network system as a queuing framework and provides a series of mathematical functions for finding an upper bound of an end-to-end delay. It is crucial for the design of networks and applications with a hard delay guarantee, such as the emerging Time Sensitive Network. LÄS MER