Consider a system of asynchronous processes that communicate among themselves by only executing read and write operations on a set of shared variables (also known as shared registers). The system has no global clock or other synchronization primitives. Every shared variable is associated with a process (called owner) which writes it and the other processes may read it. An execution of a write (...

To control the exponential growth of malware files, security analysts pursue dynamic approaches that automatically identify and analyze malicious software samples. Obfuscation and polymorphism employed by malwares make it difficult for signature-based systems to detect sophisticated malware files. The dynamic analysis or run-time behavior provides a better technique to identify the threat. In t...

An arithmetic version of the crosscorrelation of two sequences is defined, generalizing Mandelbaum’s arithmetic autocorrelations. Large families of sequences are constructed with ideal (vanishing) arithmetic cross-correlations. These sequences are decimations of the 2-adic expansions of rational numbers p/q such that 2 is a primitive root modulo q.

In this paper, we introduce a vectorial conception of dFCSRs to build these registers over any finite field. We describe the structure of d-vectorial FCSRs and we develop an analysis to obtain basic properties like periodicity and the existence of maximal length sequences. To illustrate these vectorial d-FCSRs, we present simple examples and we compare with those of Goresky, Klapper and Xu.

In this paper we study the distribution properties of d-FCSR sequences. These sequences have efficient generators and have several good statistical properties. We show that for d = 2 the number of occurrences of an fixed size subsequence differs from the average number of occurrences by at most a small constant times the square root of the average.