Filetype
This book constitutes the refereed proceedings of the 14th International Workshop on Post-Quantum Cryptography, PQCrypto 2022, held in College Park, MD, USA, in August 14–18, 2023.The 25 full papers presented in this book were carefully reviewed and selected from 51 submissions. They are categorized in the following topical sections: code-based cryptography; group-action-based cryptography; isogen
Pseudo-random functions are a fundamental building block in many cryptographic applications. In certain scenarios, a weaker notion (where security is restricted to uniformly random input), but more computationally efficient, called weak pseudo-random functions, is sufficient. In this work, we present new differential attacks on the main binary weak pseudo-random function constructions, namely the
We designed and simulated a 1 GHz planar dipole antenna that is cloaked in a band around 10 GHz. Relative to an uncloaked antenna it has a reduced extinction cross-section for the co-antenna polarization, at the cost of an increased cross-polarization. This reduced extinction cross-section characterizes a reduction in scattering and absorption, and so reduced interference to electromagnetic waves
Connected and automated vehicles (CAVs) will be a key component of future cooperative intelligent transportation systems (C-ITS). Since the adoption of C-ITS is not foreseen to happen instantly, not all of its elements are going to be connected at the early deployment stages. We consider a scenario where vehicles approaching a traffic light are connected to each other, but the traffic light itself
A memetic framework for optimal inverse design is proposed by combining a local gradient-based procedure and a robust global scheme. The procedure is based on method-of-moments matrices and does not demand full inversion of a system matrix. Fundamental bounds are evaluated for all optimized metrics in the same manner, providing natural stopping criteria and quality measures for realized devices. C
This thesis unfolds a journey into the realm of cloud integrated systems. More specifically, it explores the transformational role of diverse cloud infrastructure, be it public or private, centralized or edge-based, when integrated into traditional systems. In this transformation, the cloud assumes the vital role of controllers. Inevitably, this shift towards cloud integration also brings into pla
Uppenbarelseboken avtäcker med sina fasansfulla syner – sin Apokalyps – vad som ska ske på den yttersta dagen, då allt ont ska förgås och ett nytt rike ska upprättas. Men numera menas ofta med apokalyps enbart den skräckfyllda, mytologiska spådomen om en framtida katastrof. Kan man istället förstå Uppenbarelsebokens syner som en varning, för den katastrof vi själva är med om att skapa här och nu,
In this paper, we revisit the rotation averaging problem applied in global Structure-from-Motion pipelines. We argue that the main problem of current methods is the minimized cost function that is only weakly connected with the input data via the estimated epipolar geometries. We propose to better model the underlying noise distributions by directly propagating the uncertainty from the point corre
In this thesis, we address three main security problems related to cryptography andcloud storage. To tackle the challenge posed by a quantum computer, we needencryption that is resistant to quantum computers. This category of cryptographyis called post-quantum cryptography. In the first paper, we solve a challengein one of the lattice-based cryptographic protocols called Nth-degree Truncatedpolyno
Solar energy simulations are used to quantify the potential of the passive use (daylight, solar gains) and the active use (photovoltaics and solar thermal) of solar energy. The simulations can be performed at different scales e.g. buildings, neighbourhoods and cities, with different requirements on the data. For example, for the neighbourhood simulations we need simplified building geometries that
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented.) points. For Steiner triple systems, (Formula presented.) -configurations are of particular interest. The smallest nontrivial such configuration is the Pasch configuration, which is a (Formula presented.) -configuration. A Steiner triple system of order (Formula presented.), an STS (Formula present
We give a significantly simplified proof of the exponential separation between regular and general resolution of Alekhnovich et al. (2007) as a consequence of a general theorem lifting proof depth to regular proof length in resolution. This simpler proof then allows us to strengthen the separation further, and to construct families of theoretically very easy benchmarks that are surprisingly hard f
Building on [Clegg et al.’96], [Impagliazzo et al.’99] established that if an unsatisfiable k-CNF formula over n variables has a refutation of size S in the polynomial calculus resolution proof system, then this formula also has a refutation of degree k + O(n log S). The proof of this works by converting a small-size refutation into a small-degree one, but at the expense of increasing the proof si
Atomic diusion and mixing processes in stellar interiors influence the structure and the surface composition of stars. Some of these processes cannot yet be modelled from the first principles, and they require calibrations. This limits their applicability in stellar models used for studies of stellar populations and Galactic evolution. Aims. Our main goal is to put constraints on the stellar struc
To systematically address non-technical engineering skills (NTES), six mandatory "Engineering Days" (Ing-dagar) were introduced in two bachelor programmes. The students were also allowed to perform voluntary activities leading to a Certification of Non-technical Engineering Competences, a certificate the students can attach to their CVs. To be certified, the student must have performed activities
Systems mixing Boolean logic and arithmetic have been a long-standing challenge for verification tools such as SAT-based bit-vector solvers. Though SAT solvers can be highly efficient for Boolean reasoning, they scale poorly once multiplication is involved. Algebraic methods using Gröbner basis reduction have recently been used to efficiently verify multiplier circuits in isolation, but generally
Sliding mode control (SMC) is to keep the system to a stable differential manifold. Model predictive control (MPC) calculates the control input by solving an optimization problem on receding horizon. The method of receding horizon sliding control (RHSC) includes the predicted information into the SMC design by combining SMC and MPC. Considering the modeling error and measurement noise, there are m
The min-sum (MS) and approximate-min* (a-min*) algorithms are alternatives of the belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. To lower the BP decoding complexity, both algorithms compute two magnitudes at each check node (CN) and pass them to the neighboring variable nodes (VNs).In this work we propose a new algorithm, ga-min*, that generalizes the MS
Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometimes get hopelessly stuck even when the linear programming (LP) relaxation is infeasible over the real
