Filtyp
Radio based localization and tracking usually require multiple receivers/transmitters or a known floor plan. This paper presents a method for anchor free indoor positioning based on single antenna ultra wideband (UWB) measurements. By using time of arrival information from multipath propagation components stemming from scatterers with different, but unknown, positions we estimate the movement of t
In this paper, we describe a passage retrieval component for a questioning answering system and we evaluate its performance on Swedish documents. We used a corpus of questions and answers transcribed from the Swedish board game Kvitt eller dubbelt and, as source for the passages, we used the articles of the Swedish version of Wikipedia. We show that Wikipedia is a suitable knowledge source to answ
A smartphone is a personal device and as such usually hosts multiple public user identities such as a phone number, email address, and Facebook account. As each smartphone has a unique Bluetooth MAC address, Bluetooth discovery can be used in combination with the user registration to a server with a Facebook account. This makes it possible to identify a nearby smartphone related to a given Faceboo
Grain-128AEAD is a stream cipher supporting authenticated encryptionwith associated data, and it is currently in round 2 of the NIST lightweight cryptostandardization process. In this paper we present and benchmark software implementations of the cipher, targeting constrained processors. The processors chosen arethe 8-bit (AVR) and 16-bit (MSP) processors used in the FELICS-AEAD framework.Both hig
In the implementation of post-quantum primitives, it is well known that all computations that handle secret information need to be implemented to run in constant time. Using the Fujisaki-Okamoto transformation or any of its different variants, a CPA-secure primitive can be converted into an IND-CCA secure KEM. In this paper we show that although the transformation does not handle secret informatio
Intellectual property rights (IPRs) represent a key concern for researchers and industry in basically all (high-tech) sectors. IPRs regularly figure prominently in scientific journals and at scientific conferences and lead to dedicated workshops to increase the awareness and “IPR savviness” of scientists. In 2015, Biotechnology Journal published a report from an expert meeting on “Synthetic Biolog
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 for BKW-style algorithms for solving LWE instances. We target minimum concrete complexity and we introduce a new reduction step where we partially reduc
Named entity linking is the task of identifying mentions of named things in text, such as “Barack Obama” or “New York”, and linking these mentions to unique identifiers. In this paper, we describe Hedwig, an end-to-end named entity linker, which uses a combination of word and character BILSTM models for mention detection, a Wikidata and Wikipedia-derived knowledge base with global information aggr
Cryptography as it is used today relies on a foundational level on the assumptionthat either the Integer Factoring Problem (IFP) or the DiscreteLogarithm Problem (DLP) is computationally intractable. In the 1990s PeterShor developed a quantum algorithm that solves both problems in polynomialtime. Since then alternative foundational mathematical problems to replace IFPand DLP have been suggested. T
Things such as organizations, persons, or locations are ubiquitous in all texts circulating on the internet, particularly in the news, forum posts, and social media. Today, there is more written material than any single person can read through during a typical lifespan. Automatic systems can help us amplify our abilities to find relevant information, where, ideally, a system would learn knowledge
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$
LSTM architectures (Hochreiter and Schmidhuber, 1997) have become standard to recognize named entities (NER) in text (Lample et al., 2016; Chiu and Nichols, 2016). Nonetheless, Zhang et al. (2015) recently proposed an approach based on fixed-size ordinally forgetting encoding (FOFE) to translate variable-length contexts into fixed-length features. This encoding method can be used with feed-forward
Birds, and especially long-distance migrants, are excellent indicators of climate-induced phenological change. Advanced spring arrival is a typical response reported in a great number of species. Earlier arrival can lead to e.g. earlier egg-laying and thus have potentially great fitness consequences. Studies have suggested that certain aspects of avian life-history can predict a likely response to
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
In vivo dosimetry of IMRT from Copenhagen University Hospital
