Filetype
The Learning with Errors problem (LWE) has become a central topic in recent cryptographic research. In this paper, we present a new solving algorithm combining important ideas from previous work on improving the Blum-Kalai-Wasserman (BKW) algorithm and ideas from sieving in lattices. The new algorithm is analyzed and demonstrates an improved asymptotic performance. For the Regev parameters $q=n^2$
SNOW 3G is a stream cipher designed in 2006 by ETSI/SAGE, serving in 3GPP as one of the standard algorithms for data confidentiality and integrity protection. It is also included in the 4G LTE standard. In this paper we derive vectorized linear approximations of the finite state machine in SNOW3G. In particular,we show one 24-bit approximation with a bias around 2−37 and one byte-oriented approxim
With the advancement of the next generation of cellular systems, flexible mechanisms for Discontinuous Reception (DRX) are needed in order to save energy. 5G will bring heterogeneous packet sizes and traffic types, as well as an increasing need for energy efficiency. The current static DRX mechanism is inadequate to meet these needs. In this paper we exploit channel prediction to develop integer p
We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve the (512,18) LPN instance with complexity less than 2 80 operations in expec
Code-based cryptography is one of the main techniques enabling cryptographic primitives in a post-quantum scenario. In particular, the MDPC scheme is a basic scheme from which many other schemes have been derived. These schemes rely on iterative decoding in the decryption process and thus have a certain small probability p of having a decryption (decoding) error.In this paper we show a very fundam
Properties of the Grain-128AEAD key re-introduction, as part of the cipher initialization, are analyzed and discussed. We consider and analyze several possible alternatives for key re-introduction and identify weaknesses, or potential weaknesses, in them. Our results show that it seems favorable to separate the state initialization, the key re-introduction, and the A/R register initialization into
Weaknesses in the Grain-128AEAD key re-introduction, as part of thecipher initialization, are analyzed and discussed. We consider and analyzeseveral possible alternatives for key re-introduction and identify weaknesses, or potential weaknesses, in them. Our results show that it seemsfavorable to separate the state initialization, the key re-introduction, andthe A/R register initialization into thr
The class of information set decoding algorithms is the best known way of decoding general codes, i.e. codes that admit no special structure, in the Hamming metric. Stern's algorithm is the origin of the most efficient algorithms in this class. In this paper we consider the same decoding problem but for a channel with soft information. We give a version of Stern's algorithm for a channel with soft
Cell-Free networking is one of the prime candidatesfor 6G networks. Despite being capable of providing the 6Gneeds, practical limitations and considerations are often neglectedin current research. In this work, we introduce the conceptof federations to dynamically scale and select the best set ofresources, e.g., antennas, computing and data resources, to servea given application. Next to communica
We investigate the persistance of embedded eigenvalues under perturbations of a certain self-adjoint Schrödinger-type differential operator in L2(R; Rn), with an asymptotically periodic potential. The studied perturbations are small and belong to a certain Banach space with a specified decay rate, in particular, a weighted space of continuous matrix valued functions. Our main result is that the se
Lund University LUMES Autumn 2000 CREATIVITY BY MEANS OF SCARCITY - A Comparative Study of Agenda 21 and the Mobilisation of Participation in two Swedish Municipalities by Max Hansson Trollebergsvägen 36 C 22731 Lund 046 14 8699 max.hansson.456@studentlu.se Supervisors: Karin Bäckstrand Department of Political Science Box 52 22100 Lund 046-2224763 karin.bäckstrand@svetlu.se Johannes Stripple Depar
https://www.lumes.lu.se/sites/lumes.lu.se/files/hansson_max.pdf - 2026-05-25
Food Diversity Estonia-Russia article_Marcella Samuels_20160320_final 1 FoodDiversity Pre-Study outreach efforts connect innovative communities as Rural Living Labs for food security Study visits to Estonia and Russia continue to broaden Baltic Sea Region network of small-scale food producers striving for food security By Marcella Samuels The FoodDiversity Pre-Study Project international conso
This paper investigates resilient performance of Air Traffic Management with future Artificial Intelligence (AI)-based tools. A case study was performed on an early prototype of an AI-enabled Flight Information Service (FIS) tool, using a survey of flight instructors and air traffic controllers, and a focus group with controllers with flying experience. The study focused on what characterizes good
This paper describes a set of methods to link entities across images and text. As a corpus, we used a data set of images, where each image is commented by a short caption and where the regions in the images are manually segmented and labeled with a category. We extracted the entity mentions from the captions and we computed a semantic similarity between the mentions and the region labels. We also
This paper presents a methodology for estimation of physically interpretable building energy performance characteristics such as: heat loss coefficient, azimuth angle dependent solar gain, and diurnal periodicity in heat-demand. The models are demonstrated on a case-study with hourly observations of district-heating connected apartment buildings in Denmark. The weather model inputs are obtained fr
This study evaluates the applicability of scaled reassigned spectrograms (ReSTS) on ultrasound radio frequency data obtained with a clinical linear array ultrasound transducer. The ReSTS's ability to resolve axially closely spaced objects in a phantom is compared to the classical cross-correlation method with respect to the ability to resolve closely spaced objects as individual reflectors using u
