Filetype
In this work, we introduce novel techniques for adapting the SCA-LDPC framework to conduct efficient plaintext-checking (PC) oracle-based side-channel attacks on NTRU-style Key Encapsulation Mechanisms (KEMs). We specifically address the unique algebraic structure of the NTRU and NTRU Prime schemes, demonstrating how to extract information related to secret variables from side channels and modeled
As the Hamming Quasi-Cyclic (HQC) cryptosystem was recently selected by NIST for standardization, a thorough evaluation of its implementation security is critical before its widespread deployment. This paper presents single-trace side-channel attacks that recover the full long-term secret key of HQC, experimentally evaluated on a protected Cortex-M4 implementation. We introduce two distinct attack
It is a common practice for symmetric-key ciphers is to encode a cryptanalysis problem as an instance of the Mixed Integer Linear Programming (MILP) and then run the instance with an efficient solver. For this purpose, it is essential to model the components in a way that is compatible with the MILP formulation while preserving the characteristics of the cipher. In this work, we look at the proble
Quantum computing has attracted substantial attention from researchers across various fields. In case of the symmetric key cryptography, the main problem is posed by the application of Grover’s search. In this work, we focus on quantum analysis of the lightweight block cipher LED. This paper proposes an optimized quantum circuit for LED, minimizing the required number of qubits, quantum gates, and
In this paper, we investigate a Multi-layer Aerial system for GenAI inference at the Edge (MAGE). Therein, ground user equipments (UEs) request image synthesis services from a remote base station (BS) that leverages the Latent Diffusion Model (LDM) for image generation. Multiple Unmanned Aerial Vehicles (UAVs) are deployed to serve the UEs for relaying their images and prompts to the BS. To reduce
We explore mission assignment and task offloading in Open Radio Access Network (Open RAN)-enabled intelligent transportation systems (ITS), where autonomous vehicles utilize mobile edge computing for efficient processing. Existing studies often overlook mission dependencies and offloading costs, leading to suboptimal decisions. To address this, we formulate a novel optimization problem that integr
In computer graphics, there are numerous aspects that must be considered when rendering images of virtual scenes:What physical light-generating phenomena do we care about? How should object and material surfaces be described? And how should these be stored to ensure as fast and efficient image rendering as possible?As a part of this thesis, a method for rendering images of scenes lit by virtual at
Line segments are powerful features complementary to points. They offer structural cues, robust to drastic viewpoint and illumination changes, and can be present even in texture-less areas. However, describing and matching them is more challenging compared to points due to partial occlusions, lack of texture, or repetitiveness. This paper introduces a new matching paradigm, where points, lines, an
In this paper we introduce the Tangent Sampson error, which is a generalization of the classical Sampson error in two-view geometry that allows for arbitrary central camera models. It only requires local gradients of the distortion map at the original correspondences (allowing for pre-computation) resulting in a negligible increase in computational cost when used in RANSAC or local refinement. The
In contrast to sparse keypoints, a handful of line segments can concisely encode the high-level scene layout, as they often delineate the main structural elements. In addition to offering strong geometric cues, they are also omnipresent in urban landscapes and indoor scenes. Despite their apparent advantages, current line-based reconstruction methods are far behind their point-based counterparts.
Finding the optimal subset of individuals to observe in order to obtain the best estimate of the average opinion of a society is a crucial problem in a wide range of applications, including policy-making, strategic business decisions, and the analysis of sociological trends. We consider the opinion vector X to be updated according to a DeGroot opinion dynamical model with stubborn agents, subject
Software applications can be described using a computational model. These Models of Computation (MoCs) define rules governing application behaviour and properties that are enforced during execution. This thesis focuses on an actor-based MoC, known as dataflow-with-firing, where applications are modelled as actors connected by buffered channels. This model yields a concurrent application descriptio
Rapid warming in the Arctic is transforming northern ecosystems and altering their role in the global carbon cycle. Rising temperatures are driving shifts in vegetation composition, phenology, and ecosystem functioning, including earlier growing seasons and the expansion of shrubs across tundra landscapes. These changes influence surface energy balance, carbon uptake, and climate feedbacks, yet su
Combinatorial optimization is a powerful way to solve complex problems, like planning, scheduling, or hardware verification, by expressing the problem in a mathematical form using discrete variables that can be solved by general solvers. Due to major advances in algorithms for solving combinatorial optimization problems, these solvers can tackle real-world challenges efficiently. However, as solve
Sensitivity measures how much the output of an algorithm changes, in terms of Hamming distance, when part of the input is modified. While approximation algorithms with low sensitivity have been developed for many problems, no sensitivity lower bounds were previously known for approximation algorithms. In this work, we establish the first polynomial lower bound on the sensitivity of (randomized) ap
The transition to post-quantum cryptography is well underway. Driven by the recognition that Shor's algorithm would render all widely deployed asymmetric cryptosystems insecure in the presence of a sufficiently capable quantum computer, the cryptographic community has spent the past decade designing, evaluating, and standardizing a new generation of public-key primitives. In 2024, ML-KEM became th
Recognising the need for PQC signature schemes with different sizes and performance trade-offs than the ML-DSA and SLH-DSA standards, in 2023, NIST launched a competition for additional signature algorithms. Among the current candidates in this competition is CROSS, a code-based scheme derived from the syndrome-decoding problem and suitable for memory-constrained devices. This paper presents a fau
Centrality – Regionality The Social Structure of Southern Sweden during the Iron Age EDITED BY LARS LARSSON AND BIRGITTA HÅRDH UPPÅKRASTUDIER 7 ACTA ARCHAEOLOGICA LUNDENSIA SERIES IN 8°, No. 40 The following information can be found in the printed version: The cover picture shows a round copper alloy brooch from the Merovingian Period, detector find from Uppåkra. © The Department of Archaeology an
