Improved Target Calculation for Model Predictive Control

In industrial Model Predictive Control (MPC) applications, it is common to perform target calculation at each sample instant. The purpose of the target calculation is to translate operational targets supplied by higher level optimization functions into control targets that are feasible in the face of current disturbances. This paper shows that the commonly used target calculation formulation is flawed, and that this can lead to significant economic loss. A method for dealing with the identi¯ed problem is proposed

Distribution and Habitat Prefernces of Eight Common Farmland Bird Species in Central Norway

Masteroppgave i terrestrisk økologi og naturforvaltning - Nord universitet 2020Sperret til 2023-09-1

Studies on the Security of Selected Advanced Asymmetric Cryptographic Primitives

The main goal of asymmetric cryptography is to provide confidential communication, which allows two parties to communicate securely even in the presence of adversaries. Ever since its invention in the seventies, asymmetric cryptography has been improved and developed further, and a formal security framework has been established around it. This framework includes different security goals, attack models, and security notions. As progress was made in the field, more advanced asymmetric cryptographic primitives were proposed, with other properties in addition to confidentiality. These new primitives also have their own definitions and notions of security. This thesis consists of two parts, where the first relates to the security of fully homomorphic encryption and related primitives. The second part presents a novel cryptographic primitive, and defines what security goals the primitive should achieve. The first part of the thesis consists of Article I, II, and III, which all pertain to the security of homomorphic encryption schemes in one respect or another. Article I demonstrates that a particular fully homomorphic encryption scheme is insecure in the sense that an adversary with access only to the public material can recover the secret key. It is also shown that this insecurity mainly stems from the operations necessary to make the scheme fully homomorphic. Article II presents an adaptive key recovery attack on a leveled homomorphic encryption scheme. The scheme in question claimed to withstand precisely such attacks, and was the only scheme of its kind to do so at the time. This part of the thesis culminates with Article III, which is an overview article on the IND-CCA1 security of all acknowledged homomorphic encryption schemes. The second part of the thesis consists of Article IV, which presents Vetted Encryption (VE), a novel asymmetric cryptographic primitive. The primitive is designed to allow a recipient to vet who may send them messages, by setting up a public filter with a public verification key, and providing each vetted sender with their own encryption key. There are three different variants of VE, based on whether the sender is identifiable to the filter and/or the recipient. Security definitions, general constructions and comparisons to already existing cryptographic primitives are provided for all three variants.Doktorgradsavhandlin

The Department of Engineering Cybernetics at NTNU: From 1994 Into the Future

A short overview of the developments at the Department of Engineering Cybernetics at NTNU over the last 15 years is given. The vision of the department is to stay among Europe's most well recognized universities in control engineering, both with respect to education and research. It is discussed how this is achieved, and will continue to be strengthened in the future

On the IND-CCA1 Security of FHE Schemes

Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arbitrary computations on encrypted material without having to decrypt it first. There are numerous FHE schemes, all of which are expanded from somewhat homomorphic encryption (SHE) schemes, and some of which are considered viable in practice. However, while these FHE schemes are semantically (IND-CPA) secure, the question of their IND-CCA1 security is much less studied, and we therefore provide an overview of the IND-CCA1 security of all acknowledged FHE schemes in this paper. To give this overview, we grouped the SHE schemes into broad categories based on their similarities and underlying hardness problems. For each category, we show that the SHE schemes are susceptible to either known adaptive key recovery attacks, a natural extension of known attacks, or our proposed attacks. Finally, we discuss the known techniques to achieve IND-CCA1-secure FHE and SHE schemes. We concluded that none of the proposed schemes were IND-CCA1-secure and that the known general constructions all had their shortcomings.publishedVersio

Bisection Algorithm based Indirect Finite Control Set Model Predictive Control for Modular Multilevel Converters

In this work, an idea based on the bisection algorithm is used to reduce the computational burden of indirect finite control set model predictive control (FCS-MPC) for modular multilevel converters (MMCs). The proposed method greatly reduces the search space for reaching the optimal insertion index (number of submodules to be inserted). Therefore, the strategy proposed offers similar steady-state and dynamic performance compared to full indirect FCS-MPC at a much lower computational burden. A new cost function is also proposed for indirect FCS-MPC which eliminates the need for an outer loop or additional control of differential current to regulate the summation voltages in each arm. The results of the proposed strategy are validated through simulations in MATLAB/Simulink.acceptedVersio

A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem

Under embargo until: 2022-07-15We present an adaptive key recovery attack on the leveled homomorphic encryption scheme suggested by Li, Galbraith and Ma (Provsec 2016), which itself is a modification of the GSW cryptosystem designed to resist key recovery attacks by using a different linear combination of secret keys for each decryption. We were able to efficiently recover the secret key for a realistic choice of parameters using a statistical attack. In particular, this means that the Li, Galbraith and Ma strategy does not prevent adaptive key recovery attacks.acceptedVersio