Essays about: "Optimal Attacks"
Showing result 1 - 5 of 26 essays containing the words Optimal Attacks.
-
1. Comparing machine learning algorithms for detecting behavioural anomalies
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : 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. READ MORE
-
2. Skillnader mellan granindivider gällande initieringsfrekvens för somatisk embryogenes
University essay from SLU/School for Forest ManagementAbstract : 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. READ MORE
-
3. Determining the Optimal Frequencies for a Duplicated Randomized Clock SCA Countermeasure
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
4. Exploring the Viability of PageRank for Attack Graph Analysis and Defence Prioritization
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE
-
5. Analysis of Flow Prolongation Using Graph Neural Network in FIFO Multiplexing System
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : 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. READ MORE