Filetype
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
At the same time as our dependence on IT systems increases, the number of reports of problems caused by failures of critical IT systems has also increased. Today, almost every societal system or service, e.g., water supply, power supply, transportation, depends on IT systems, and failures of these systems have serious and negative effects on society. In general, public organizations are responsibl
We believe that enabling services to collaborate, even if they were not designed to work together, will be important for the success of the Internet of Things (IoT). To support this we have designed a domain specific language (DSL) for service composition with the focus on mobile and IoT systems. We demonstrate this DSL by building an example system that helps a birdwatcher spy on the birds in her
It is a conundrum that agile projects can succeed ‘without requirements’ when weak requirements engineering is a known cause for project failures. While Agile development projects often manage well without extensive requirements documentation, test cases are commonly used as requirements. We have investigated this agile practice at three companies in order to understand how test cases can fill the
Software engineers handle a lot of information intheir daily work. We explore how software engineers interact withinformation management systems/tools, and to what extent thesesystems expose users to increased cognitive load. We reviewed theliterature of cognitive aspects, relevant for software engineering,and performed an exploratory case study on how software engi-neers perceive informa
Using 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. The Stern algorithm is the origin of the most efficient algorithms in this class. We consider the same decoding problem but for a channel with soft information. We give a version of the Stern algorithm for a channel with soft inf
In this paper we present an approach to gaining increased anonymity from authorities within a VANET. Standardization organizations and researchers working on VANETs recognize privacy as highly important. However, most research focuses on privacy from other vehicles and external attackers, as opposed to privacy from system-administrating authorities. Our proposed solution forces authorities to reso
The communication of requirements within software development is vital for project success. Requirements engineering and testing are two processes that when aligned can enable the discovery of issues and misunderstandings earlier, rather than later, and avoid costly and time-consuming rework and delays. There are a number of practices that support requirements-test alignment. However, each organis
Radio links in wireless mesh networks (WMN) can select one of several modulation and coding schemes (MCS). A MCS assignment influences links data rates and their mutual interference, and therefore should be optimized. We consider joint optimization of link rate assignment and transmission scheduling in order to maximize the minimal flow in a WMN. One of the main difficulties stems from the require
As new technologies emerge such as wearables, it opens up for new challenges, especially related to security and privacy. One such recent technology is smart glasses. The use of glasses introduces security and privacy concerns for the general public but also for the user itself. In this paper we present ongoing theoretical work which focus on privacy of the user during authentication. We propose a
Abstract in UndeterminedThe properties of the single-link multiple-input-multiple- output (MIMO) propagation channels have been analyzed in many studies based on extensive propagation measurements. In this letter, we extend the measurement-based analysis to dual-link MIMO propagation channels. Here, we examine interlink correlation by evaluating the correlation of eigenvectors obtained from multip
Proximity of user has been established as a major cause of performance degradation in multiple-input multiple-output (MIMO) terminals. Here, we investigate the potential of adaptive impedance matching (AIM) to improve the performance of two MIMO terminals in a free space (FS) and a two-hand (TH) user scenario, assuming uniform 3D angular power spectrum for the incoming signal. The results show tha
In this paper an implementation of a reduced complexity matching pursuit channel estimator for LTE is presented. The design contains an FFT/IFFT module with non-radix 2 units and the core estimator. The FFT/IFFT module is flexible enough to perform both operations using the same hardware. Based on prior work the needed internal word lengths are found. Internal shifts are employed to maximize the u
In this article, we revisit a classical optimization problem occurring in designing survivable multicommodity flow networks. The problem, referred to as FR, assumes flow restoration that takes advantage of the so-called stub release. As no compact linear programming (LP) formulation of FR is known and at the same time all known noncompact LP formulations of FR exhibit NP-hard dual separation, the
In many organisations a gap exists between IT management and emergency managemement. This paper illustrates how process improvement based on a maturity model can be used to help organisations to evaluate and improve the way they include IT dependability information in their emergency management. This paper presents the IDEM3 (IT Dependability in Emergency Management Maturity Model) process improve
We derive the interarrival distribution of a workload input process which is a variation of the infinite source Poisson process for packet traffic. It accounts for long-range dependence and self-similarity exhibited by real traces in the Internet. The packet generation process is compound Poisson over each session which has a heavy tailed distribution. Considering the dependence induced by the wor
It is well known that fast correlation attacks can be very efficient if the feedback polynomial is of low weight. These feedback polynomials can be considered weak in the context of stream ciphers. This paper generalizes the class of weak feedback polynomials into polynomials were taps are located in several groups, possibly far apart. Low weight feedback polynomials are thus a special case of thi
