Filtyp
Software-Defined Networking (SDN) is a novel architectural model for cloud network infrastructure, improving resource utilization, scalability and administration. SDN deployments increasingly rely on virtual switches executing on commodity operating systems with large code bases, which are prime targets for adversaries attacking the network infrastructure. We describe and implement TruSDN, a frame
NTRU is a public-key cryptosystem, where the underlying mathematical problem is currently safe against large-scale quantum computer attacks. The system is not as well investigated, as for example RSA, and the company behind NTRU has created the NTRU Challenges, to remedy this. These challenges consist of 27 different public keys of increasing size, where the task in each challenge is to calculate
Guo et al. recently presented a reaction attack against the QC-MDPC McEliece cryptosystem. Their attack is based on the observation that when a bit-flipping decoding algorithm is used in the QC-MDPC McEliece, then there exists a dependence between the secret matrix H and the failure probability of the bit-flipping algorithm. This dependence can be exploited to reveal the matrix H which constitutes
FoodDiversity PreStudy launches at Sambruket New Baltic Sea Region partnership explores benefits of integrating biodiversity into small-scale food production to enhance food security By Marcella Samuels The FoodDiversity Pre-Study Project had an energetic start at its kickoff meeting held August 19th-21st on the beautiful grounds of Sambruket i Sösdalabygden (previously named Södra Rörums Sambruk)
https://www.keg.lu.se/sites/keg.lu.se/files/food_diversity_kickoff_article_marcella_carby-samuels_20150904.pdf - 2026-06-08
Flow thinning (FT) is an active traffic protection mechanism destined for communication networks with variable capacity of links, as for example wireless networks. In FT, end-to-end traffic demands are equipped with dedicated logical tunnels (for example MPLS tunnels) whose maximal capacity is subject to thinning in order to follow the fluctuations of the currently available link capacity. It foll
The presented work is motivated by Free Space Optics (FSO) communications. FSO is a well established wireless optical transmission technology considered as an alternative to radio communications for example in metropolitan wireless mesh networks. An FSO link is established by means of a laser beam between the transmitter and the receiver placed in the line of sight. A major disadvantage of FSO lin
Intel Software Guard Extensions (SGX) provides a trusted execution environment (TEE) to run code and operate sensitive data.SGX provides runtime hardware protection where both code and data are protected even if other code components are malicious.However, recently many attacks targeting SGX have been identified and introduced that can thwart the hardware defence provided by SGX.In this paper we p
Flow thinning (FT) is a traffic routing and protection strategy for communication networks whose links experience fluctuations in available capacity (as, e.g., in wireless networks). To cope with this phenomenon, end-to-end traffic demands are assigned dedicated tunnels (e.g., MPLS tunnels) whose nominal capacity is subject to thinning in order to account for variable capacity of the links, fluctu
The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper presents new improvements of BKW-style algorithms for solving LWE instances. We target minimum concrete complexity, and we introduce a new reduction step where we partially reduc
In this paper, we present a side-channel attack on a first-order masked implementation of IND-CCA secure Saber KEM. We show how to recover both the session key and the long-term secret key from 24 traces using a deep neural network created at the profiling stage. The proposed message recovery approach learns a higher-order model directly, without explicitly extracting random masks at each executio
This chapter is devoted to modeling and optimization techniques applicable to communication network design and planning. The main emphasis is put on the models dealing with optimization of the capacity of network resources and traffic routing that lead to tractable optimization problems. It is a common belief that the right means for such modeling are multicommodity flow networks (MFN). MFN form a
We implement the Grain-128AEAD stream cipher in hardware, using a 65 nm library. By exploring different optimization techniques, both at RTL level but also during synthesis, we first target high throughput, then low power. We reach over 33 GB/s targeting a high-speed design, at expense of power and area. We also show that, when targeting low power, the design only requires 0.23 $${\upmu }$$W runni
Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted proposals rely on problems related to Learning with Errors. Such schemes often include the possibility of decryption errors with some very small probability. Some of them have a som
We improve iterative decoding of the moderate density parity-check codes, recently suggested as code candidates in the McEliece public key cryptosystem. In case of bit-flipping (BF) decoder failure, the code parity-check matrix is extended by adding auxiliary variable nodes based on reliability information from the BF decoder. Then iterative decoding is applied to the extended parity-check matrix.
Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.’s work at ASIACRYPT 2018, this paper further studies the concrete security of one important class of local pseudorandom generators, i.e., Goldreich’s pseudorandom generators. Our first attack is of the guess-and
We study a scenario where a monitor is interested in the freshest possible update from a remote sensor. The monitor also seeks to minimize the number of updates that exceed a certain freshness threshold, beyond which, the information is deemed to be too old. Previous work has presented results for First Come First Served (FCFS) systems. However, it has been shown that Last Come First Served (LCFS)
Although a number of different medium access control (MAC) schemes are adopted for wireless multi-hop networks, time division multiple access (TDMA) approaches based on a periodic frame of time slots are the most common when very high efficiency is needed in terms of use of radio and energy resources. Efficient resource usage is typically based on parallel compatible transmissions from multiple no
The widespread deployment of digital technologies has made the globe an interconnected world. Among other necessities of the digitalized world, cybersecurity is a crucial component. Therefore, education and proper training of the cybersecurity workforce are essential for building a strong national and global community. However, a significant shortage of proficient cybersecurity experts is reported
Optical wireless networks realized by means of gigabit optical wireless communication (OWC) systems are becoming, in a variety of applications, an important alternative, or a complementary solution, to their fiber-based counterparts. However, performance of the OWC systems can be considerably degraded in periods of unfavorable weather conditions, such as heavy fog, which temporarily reduce the eff
Mobile and wireless data are in increasing demand worldwide. New trends such as the Internet of Things paradigm and the Smart City paradigm describe scenarios comprising thousands of devices all exchanging information amongst themselves wirelessly --- or through the WAN to another device, possibly connected to another WLAN. Operators and radio engineers are faced with the problem of designing effi
