Filtyp
We study stochastic interaction network models whereby a finite population of agents, identified with the nodes of a graph, update their states in response to pairwise interactions with their neighbors as well as spontaneous mutations. These include the main epidemic models, such as the Susceptible-Infected -Susceptible, the Susceptible-Infected-Recovered, and the Susceptible-Infected-Recovered-Su
The wide spread of on-line social networks poses new challenges in information environment and cybersecurity. A key issue is detecting stubborn behaviors to identify leaders and influencers for marketing purposes, or extremists and automatic bots as potential threats. Existing literature typically relies on known network topology and extensive centrality measures computation. However, the size of
We uncover a critical side-channel vulnerability in the Hamming Quasi-Cyclic (HQC) round 4 optimized implementation arising due to the use of the modulo operator. In some cases, compilers optimize uses of the modulo operator with compiletime known divisors into constant-time Barrett reductions. However, this optimization is not guaranteed: for example, when a modulo operation is used in a loop the
After the COVID-19 pandemic, during which teachers developed a lot of online course material, teachers worldwide are challenged with how to combine online teaching with classroom teaching in an efficient way. This paper presents Discussion seminars, a teaching activity that structures discussions clearly, making it easy for students and teachers to follow the discussion. The paper puts Discussion
We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al.'99] also on proof size. [Alekhnovich and Razborov'03] established that if the clause-variable incidence graph of a conjunctive normal form (CNF) formula F is a good enough expander, then proving that F is unsatisfiable requires high
The analysis of interconnected systems is a large and growing field, with successful applications in a wide range of natural and synthesized systems. Biomolecular networks, power grids and human social dynamics have all been the subject of study through the lens of network dynamics, with impressive results. The work presented in this thesis takes the form of four research papers all focusing in di
Effective preprocessing of electroencephalography (EEG) data is fundamental for deriving meaningful insights. Independent component analysis (ICA) serves as an important step in this process by aiming to eliminate undesirable artifacts from EEG data. However, the decision on which and how many components to be removed remains somewhat arbitrary, despite the availability of both automatic and manua
In this paper, we introduce OT-PCA, a novel approach for conducting Plaintext-Checking (PC) oracle based side-channel attacks, specifically designed for Hamming Quasi-Cyclic (HQC). By calling the publicly accessible HQC decoder, we build offline templates that enable efficient extraction of soft information for hundreds of secret positions with just a single PC oracle call. Our method addresses cr
In this thesis, we provide a number of novel algebraic means of certifying stability and performance for linear systems constrained in various ways by cones. The purpose is mainly threefold: to provide mathematical statements with applicative potential, to unify seemingly dissimilar results in the literature and thereby increase understanding, and to advance the state of the art on dynamical syste
Exceptional are the instances where explicit solutions to optimal control problems are obtainable. Of particular interest are the explicit solutions derived for minimax problems, as they provide a framework for addressing challenges involving adversarial conditions and uncertainties. This thesis presents explicit solutions to a novel class of minimax optimal control problems for positive linear sy
In this paper, we introduce an oracle version of the Restricted Syndrome Decoding Problem (RSDP) and propose novel authentication protocols based on the hardness of this problem. They follow the basic structure of the HB-family of authentication protocols and later improvements but demonstrate several advantages.An appropriate choice of multiplicative subgroup and ring structure gives rise to a ve
The evolution of the fifth-generation network (5G) increases the demand and use of Internet of Things (IoT) devices extensively. The increased number of IoT devices increases the possibility of new attack surfaces, and thus even resource-constrained IoT devices need secure communication. In this work, we consider the Julia Key Agreement (JKA) protocol, which has been proposed as a secure and effic
This thesis investigates scalable control design for networked dynamical systems, which are of great importance due to their wide range of practical applications, including large-scale formation control. A central challenge in such systems is enabling agents to coordinate effectively based only on local and relative information, particularly as the system size increases. To address this, the thesi
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has been recently turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already pro
This thesis discusses novel results in the area of code-based cryptography, ranging from cryptanalyses on several code-based cryptographic constructions to proposing a code-based authentication scheme based on a novel Syndrome Decoding variant.To address the looming threat of large-scale quantum computers that wouldbreak many widely-used public-key cryptosystems, the National Institute of Stan-dar
We study dynamics in a network of interacting agents updating their binary states according to a time-varying threshold rule. Specifically, agents revise their state asynchronously by comparing the weighted average of the current states of their neighbors in the interaction network with possibly heterogeneous time-varying threshold values. Such thresholds are determined by an exogenous signal repr
We propose and study a weakly convergent variant of the forward-backward algorithm for solving structured monotone inclusion problems. Our algorithm features a per-iteration deviation vector, providing additional degrees of freedom. The only requirement on the deviation vector to guarantee convergence is that its norm is bounded by a quantity that can be computed online. This approach offers great
In order to keep up with the constant demand for higher data rates, the fifth generation of mobile communication (5G) introduced the use of mm-wave carrier frequencies from 24 to 71 GHz. Plenty of new frequency spectrum then became available, which has allowed for channel bandwidths of several hundreds of MHz. 6G is projected to continue this trend with even higher carrier frequencies and wider ba
This thesis delves into the multifaceted challenges of designing analog-to-digital converters (ADCs) tailored for high-speed and medium accuracy applications, particularly in deeply scaled-down CMOS technologies across five comprehensive chapters within its Introduction. Furthermore, it explores the evolution of mobile telephony from the first-generation (1G) to the last commercialized generation
Progenitor cells adapt their behavior in response to tissue demands. However, the molecular mechanisms controlling esophageal progenitor decisions remain largely unknown. Here, we demonstrate the presence of a Troy (Tnfrsf19)-expressing progenitor subpopulation localized to defined regions along the mouse esophageal axis. Lineage tracing and mathematical modeling demonstrate that Troy-positive pro
