The challenge of detecting intracluster filaments with Faraday Rotation

The detection of filaments in the cosmic web will be crucial to distinguish between the possible magnetogenesis scenarios and future large polarization surveys will be able to shed light on their magnetization level. In this work, we use numerical simulations of galaxy clusters to investigate their possible detection. We compute the Faraday Rotation signal in intracluster filaments and compare it to its surrounding environment. We find that the expected big improvement in sensitivity with the SKA-MID will in principle allow the detection of a large fraction of filaments surrounding galaxy clusters. However, the contamination of the intrinsic Faraday Rotation of background polarized sources will represent a big limiter to the number of objects that can be significantly detected. We discuss possible strategies to minimize this effect and increase the chances of detection of the cosmic web with the large statistics expected from future surveys.Comment: 16 pages, accepted to Galaxie

A Physical Layer Secured Key Distribution Technique for IEEE 802.11g Wireless Networks

Key distribution and renewing in wireless local area networks is a crucial issue to guarantee that unauthorized users are prevented from accessing the network. In this paper, we propose a technique for allowing an automatic bootstrap and periodic renewing of the network key by exploiting physical layer security principles, that is, the inherent differences among transmission channels. The proposed technique is based on scrambling of groups of consecutive packets and does not need the use of an initial authentication nor automatic repeat request protocols. We present a modification of the scrambling circuits included in the IEEE 802.11g standard which allows for a suitable error propagation at the unauthorized receiver, thus achieving physical layer security.Comment: 9 pages, 7 figures. Accepted for publication in IEEE Wireless Communications Letters. Copyright transferred to IEE

Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes

We consider the framework of the McEliece cryptosystem based on LDPC codes, which is a promising post-quantum alternative to classical public key cryptosystems. The use of LDPC codes in this context allows to achieve good security levels with very compact keys, which is an important advantage over the classical McEliece cryptosystem based on Goppa codes. However, only regular LDPC codes have been considered up to now, while some further improvement can be achieved by using irregular LDPC codes, which are known to achieve better error correction performance than regular LDPC codes. This is shown in this paper, for the first time at our knowledge. The possible use of irregular transformation matrices is also investigated, which further increases the efficiency of the system, especially in regard to the public key size.Comment: 6 pages, 3 figures, presented at ISCC 201

LDPC coded transmissions over the Gaussian broadcast channel with confidential messages

We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for the Gaussian broadcast channel with confidential messages (BCC). This channel model is different from the classical wiretap channel model as the unauthorized receiver (Eve) must be able to decode some part of the information. Hence, the reliability and security targets are different from those of the wiretap channel. In order to design and assess practical coding schemes, we use the error rate as a metric of the performance achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve). We study the system feasibility, and show that two different levels of protection against noise are required on the public and the secret messages. This can be achieved in two ways: i) by using LDPC codes with unequal error protection (UEP) of the transmitted information bits or ii) by using two classical non-UEP LDPC codes with different rates. We compare these two approaches and show that, for the considered examples, the solution exploiting UEP LDPC codes is more efficient than that using non-UEP LDPC codes.Comment: 5 pages, 5 figures, to be presented at IEEE ICT 201

AONT-LT: a Data Protection Scheme for Cloud and Cooperative Storage Systems

We propose a variant of the well-known AONT-RS scheme for dispersed storage systems. The novelty consists in replacing the Reed-Solomon code with rateless Luby transform codes. The resulting system, named AONT-LT, is able to improve the performance by dispersing the data over an arbitrarily large number of storage nodes while ensuring limited complexity. The proposed solution is particularly suitable in the case of cooperative storage systems. It is shown that while the AONT-RS scheme requires the adoption of fragmentation for achieving widespread distribution, thus penalizing the performance, the new AONT-LT scheme can exploit variable length codes which allow to achieve very good performance and scalability.Comment: 6 pages, 8 figures, to be presented at the 2014 High Performance Computing & Simulation Conference (HPCS 2014) - Workshop on Security, Privacy and Performance in Cloud Computin

Distributed Observer Analysis and Design

A Distributed observer design is described for estimating the state of a continuous-time, input free, linear system. This thesis explains how to construct the local estimators, which comprise the observer inputs and outputs, and it is shown which are the requirements to deal with this structure. Every agent senses an output signal from the system and distributes it across a fixed-time network to its neighbors. The information flow increases the capability of each agent to estimate the state of the system and uses collaboration to improve the quality of data. The proposed solution has several positive features compared to recent results in the literature, which include milder assumptions on the network connectivity and the maximum dimension of the state of each observer does not exceed the order of the plant. The conditions are reduced to certain detectability requirements for each cluster of agents in the network, where a cluster is identified as a subset of agents that satisfy specific properties. Instead, the dimension of each observer is reduced to the number of possible observable states of the system, collected by the agent and by the neighbors

On the astronomical origin of the Hallstatt oscillation found in radiocarbon and climate records throughout the Holocene

An oscillation with a period of about 2100-2500 years, the Hallstatt cycle, is found in cosmogenic radioisotopes (C-14 and Be-10) and in paleoclimate records throughout the Holocene. Herein we demonstrate the astronomical origin of this cycle. Namely, this oscillation is coherent to the major stable resonance involving the four Jovian planets - Jupiter, Saturn, Uranus and Neptune - whose period is p=2318 yr. The Hallstatt cycle could derive from the rhythmic variation of the circularity of the solar system disk assuming that this dynamics could eventually modulate the solar wind and, consequently, the incoming cosmic ray flux and/or the interplanetary/cosmic dust concentration around the Earth-Moon system. The orbit of the planetary mass center (PMC) relative to the Sun is used as a proxy. We analyzed how the instantaneous eccentricity vector of this virtual orbit varies from 13,000 B. C. to 17,000 A. D.. We found that it undergoes kind of pulsations as it clearly presents rhythmic contraction and expansion patterns with a 2318 yr period together with a number of already known faster oscillations associated to the planetary orbital stable resonances. We found that a fast expansion of the Sun-PMC orbit followed by a slow contraction appears to prevent cosmic rays to enter within the system inner region while a slow expansion followed by a fast contraction favors it. Similarly, the same dynamics could modulate the amount of interplanetary/cosmic dust falling on Earth. These would then cause both the radionucleotide production and climate change by means of a cloud/albedo modulation. Other stable orbital resonance frequencies (e.g. at periods of 20 yr, 45 yr, 60 yr, 85 yr, 159-171-185 yr, etc.) are found in radionucleotide, solar, aurora and climate records, as determined in the scientific literature. Thus, the result supports a planetary theory of solar and/or climate variation.Comment: 36 pages, 14 figures, 1 tabl

Practical LDPC coded modulation schemes for the fading broadcast channel with confidential messages

The broadcast channel with confidential messages is a well studied scenario from the theoretical standpoint, but there is still lack of practical schemes able to achieve some fixed level of reliability and security over such a channel. In this paper, we consider a quasi-static fading channel in which both public and private messages must be sent from the transmitter to the receivers, and we aim at designing suitable coding and modulation schemes to achieve such a target. For this purpose, we adopt the error rate as a metric, by considering that reliability (security) is achieved when a sufficiently low (high) error rate is experienced at the receiving side. We show that some conditions exist on the system feasibility, and that some outage probability must be tolerated to cope with the fading nature of the channel. The proposed solution exploits low-density parity-check codes with unequal error protection, which are able to guarantee two different levels of protection against noise for the public and the private information, in conjunction with different modulation schemes for the public and the private message bits.Comment: 6 pages, 4 figures, to be presented at IEEE ICC'14 - Workshop on Wireless Physical Layer Securit

Interlocking directorates and different power forms: An explorative analysis in the Italian context

The purpose of the present paper is twofold. The first is to update the contribution by Drago et al. (2011) about cross-shareholdings and interlocking directorates in Italian listed companies (FTSE MIB) to 31 December 2016 and to reinforce theory of enlarged collusion. The second is to find how interlocking directorates can contribute to understanding the power structure. By using the social network analysis, we map the network structure of interlocking boards and employ centrality measures like degree, eigenvector and betweenness centrality along with the network density and average degree. We interpret eigenvector centrality as a measure of “effective power” of the connections because it can be seen as a weighted sum of not only direct connections but indirect connections, while betweenness centrality as a measure of “potential power” because it is a proxy of the volume of information that passes through the nodes. In this way, we provide a framework for selecting Italian firms with effective and potential power – around whom interactions and processes can be traced and analysed. In addition, we find that the position assumed by the controlling group of the Mediobanca Galaxy is definitely downsized

Low-power Secret-key Agreement over OFDM

Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.Comment: 9 pages, 4 figures; this is the authors prepared version of the paper with the same name accepted for HotWiSec 2013, the Second ACM Workshop on Hot Topics on Wireless Network Security and Privacy, Budapest, Hungary 17-19 April 201