SearcharxivSearch

arXiv subjects

Marcos Charalambides

Publications and source records attributed to Marcos Charalambides.

7 recordsLinked to original sources

Proving the Utility of Large Language Models in Cybersecurity Simulations: A Comprehensive Examination

Cyber threats continue to escalate in both frequency and sophistication, necessitating more adaptive and scalable defense strategies. This paper explores how Large Language Models (LLMs) can bolster cybersecurity simulations by automating the creation of synthetic environments and identifying latent vulnerabilities. We employ YAML as a structured representation format for simulating complex network configurations, thereby enabling Large Language Model-driven pipelines to support and improve reinforcement learning (RL) agent training. Comparative studies examine the advantages of LLM-based techniques over classical approaches such as Double Q-learning with Prioritized Experience Replay (PER), emphasizing increased efficiency, higher adaptability, and enhanced realism in cyberattack simulations. In empirical benchmarks across multiple synthetic topologies, LLM-instantiated Python agents achieved up to a 94.5% compromise rate while executing in 0.02-0.06 seconds per assessment---a ~25,000x to 50,000x speedup over traditional RL training cycles. Our findings underscore the transformative potential of integrating LLMs into cybersecurity research, ultimately paving the way for more intelligent and robust cyber-defense systems.

cs.CR

Inferring proximity from Bluetooth Low Energy RSSI with Unscented Kalman Smoothers

The Covid-19 pandemic has resulted in a variety of approaches for managing infection outbreaks in international populations. One example is mobile phone applications, which attempt to alert infected individuals and their contacts by automatically inferring two key components of infection risk: the proximity to an individual who may be infected, and the duration of proximity. The former component, proximity, relies on Bluetooth Low Energy (BLE) Received Signal Strength Indicator(RSSI) as a distance sensor, and this has been shown to be problematic; not least because of unpredictable variations caused by different device types, device location on-body, device orientation, the local environment and the general noise associated with radio frequency propagation. In this paper, we present an approach that infers posterior probabilities over distance given sequences of RSSI values. Using a single-dimensional Unscented Kalman Smoother (UKS) for non-linear state space modelling, we outline several Gaussian process observation transforms, including: a generative model that directly captures sources of variation; and a discriminative model that learns a suitable observation function from training data using both distance and infection risk as optimisation objective functions. Our results show that good risk prediction can be achieved in $\mathcal{O}(n)$ time on real-world data sets, with the UKS outperforming more traditional classification methods learned from the same training data.

eess.SP

Distinct Distances on Curves via Rigidity

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the latter case, there are arrangements of $N$ points which determine $\lesssim N$ distinct distances. The method may be applied to other quantities of interest to obtain analogous exponent gaps. An important step in the proof involves understanding the structural rigidity of certain frameworks on curves.

math.MG

A note on distinct distance subsets

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

math.CO

On Restricting Cauchy-Pexider Equations to Submanifolds

Sufficient geometric conditions are given which determine when the Cauchy-Pexider functional equation f(x)g(y)=h(x+y) restricted to x,y lying on a hypersurface in R^d has only solutions which extend uniquely to exponential affine functions. Some related functional equations are also considered.

math.CA

Near-extremizers of Young's inequality for discrete groups

Those functions which nearly extremize Young's convolution inequality are characterized for discrete groups which have no nontrivial finite subgroups. Near-extremizers of the Hausdorff-Young inequality are characterized for Z^d.

math.CA