Summary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear

Summary form only given. The windmill technique is an attractive alternative to the Lempel-Eastman technique for fast m-sequence generation. The author has generalized the class of linear recurrence relations for which the windmill technique results in an m-sequence generator. A converse to a set of known necessary conditions has been obtained.

As demonstrated by the recent attack on Intel's Ivy Bridge processor, the traditional Logic Built-In Self-Test (LBIST) methods do not provide adequate protection of SoC against malicious modifications known as hardware Trojans. In this paper, we introduce a simple but efficient countermeasure against hardware Trojans which exploits non-zero aliasing probability of LBIST. We propose to generate LBI

The prediction and probability assignment (PPA) concept is important in lossless image compression. We report on a new approximate technique for PPA based on local optimization.

A new message authentication code (MAC) is described that exploits the tree structure present in many modern document formats, e.g. SGML and XML. The new code supports incremental updating of the cryptographic checksum in the process of making incremental changes to the document. Theoretical bounds on the probability of a successful substitution attack are derived. Through experimental results we

Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.

The verification of the authenticity of a text document or a datafile is one of the main applications of cryptographic techniques. A common used technique for this purpose is the application of a message authentication code (MAC). Usually the MAC computation has to be done in software. Based on the relationship between error-correcting codes and so-called families of almost universal hash function

Some of the best compression ratios for text compression are provided by the PPM (prediction by partial matching) class of algorithms. These algorithms are based on arithmetic coding using a fixed-depth Markov chain model of the source, i.e., the subsequence of symbols generated in any state s of the source is assumed to be the output of a memoryless subsource w=w(s). One of the most crucial steps

We present a coding theoretic approach to the problem the initial state recovery of a linear feedback shift register when a noisy output sequence is given. Our work is focused on the investigation of the asymptotical behaviour of the recovery process. We give two algorithms which will work for shift registers with arbitrary feedback polynomial. Furthermore, the number of required given noisy symbo

We present an analysis of some known cartesian authentication codes and their modification into authentication codes with secrecy, with transmission rate R = r/n, where n = 2, 3, …, and 1 ≤ r ≤ n - 1 using (n - r)(r + 1) q-ary key digits. For this purpose we use a grouping technique. Essentially the same key grouping technique is used for the construction of codes that withstand spoofing attacks o

Heterogeneous catalyst surfaces are dynamic entities that respond rapidly to changes in their local gas environment, and the dynamics of the response is a decisive factor for the catalysts’ action and activity. Few probes are able to map catalyst structure and local gas environment simultaneously under reaction conditions at the timescales of the dynamic changes. Here we use the CO oxidation react

Scaling down material synthesis to crystalline structures only few atoms in size and precisely positioned in device configurations remains highly challenging, but is crucial for new applications e.g., in quantum computing. We propose to use the sidewall facets of larger III–V semiconductor nanowires (NWs), with controllable axial stacking of different crystal phases, as templates for site-selectiv

Free-electron lasers (FELs) can produce radiation in the short wavelength range extending from the extreme ultraviolet (XUV) to the X-rays with a few to a few tens of femtoseconds pulse duration. These facilities have enabled significant breakthroughs in the field of atomic, molecular, and optical physics, implementing different schemes based on two-color photoionization mechanisms. In this articl

”Conflict in Colours” är en avhandling som fokuserar på historiska narrativs roll i att legitimera och bibehålla konflikter, samt hur dessa narrativ påverkar den begynnande fredsprocessen. Genom att studera det inneboende kulturella våldet i dessa narrativ har jag visat hur kulturellt våld är en essentiell del i att legitimera, påverka och bibehålla det antagonistiska förhållandet mellan parterna Conflict in Colours is a book about the role of cultural violence in maintaining and transferring conflict situations by investigating republican and loyalist murals in Belfast during the Troubles and the Northern Irish peace process. During several decades, the people of Northern Ireland have endured warlike situations before the peace agreement in 1998. This doctoral thesis examines the ways/how