Ultra-lightweight true random number generators

A series of ultra-lightweight digital true random number generators (TRNGs) are presented. These TRNGs are based on the observation that, when a circuit switches from a metastable state to a bi-stable state, the resulting state may be random. Four such circuits with low hardware cost are presented: one uses an XOR gate; one uses a lookup table; one uses a multiplexer and an inverter; and one uses four transistors. The three TRNGs based on the first three circuits are implemented on a field programmable gate array and successfully pass the DIEHARD RNG tests and the National Institute of Standard and Technology (NIST) RNG tests. To the best of the authors' knowledge, the proposed TRNG designs are the most lightweight among existing TRNGs.

Abnormal rolls and regular arrays of disclinations in homeotropic electroconvection

We present the first quantitative verification of an amplitude description for systems with (nearly) spontaneously broken isotropy, in particular for the recently discovered abnormal-roll states. We also obtain a conclusive picture of the three-dimensional director configuration in a spatial period doubling phenomenon involving disclination loops. The first observation of two Lifshitz frequencies in electroconvection is reported.

Detailed analytical investigation of magnetic field line random walk in turbulent plasmas: I. Two-component slab/two-dimensional turbulence

The random displacement of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. A two-component (slab/two-dimensional composite) model for the turbulence spectrum is employes. An analytical investigation of the asymptotic behavior of the field-line mean square displacement (FL-MSD) is carried out. It is shown that the magnetic field lines behave superdifusively for every large values of the position variable z, since the FL-MSD sigma varies as sigma similar to z(4/3). An intermediate diffusive regime may also possible exist for finite values of z under conditions which are explicitly determined in terms of the intrinsic turbulent plasma parameters. The superdiffusie asymptotic result is confirmed numerically via an iterative algorithm. The relevance to previous resuslts is discussed.

Detailed analytical investigation of magnetic field line random walk in turbulent plasmas: II. Isotropic turbulence

The random walk of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. An isotropic model is employed for the magnetic turbulence spectrum. An analytical investigation of the asymptotic behavior of the field-line mean-square displacement is carried out. in terms of the position variable z. It is shown that varies as similar to z ln z for large distance z. This result corresponds to a superdiffusive behavior of field line wandering. This investigation complements previous work, which relied on a two-component model for the turbulence spectrum. Contrary to that model, quasilinear theory appears to provide an adequate description of the field line random walk for isotropic turbulence.

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Information theoretic measures of UHG graphs with low computational complexity

We introduce a novel graph class we call universal hierarchical graphs (UHG) whose topology can be found numerously in problems representing, e.g., temporal, spacial or general process structures of systems. For this graph class we show, that we can naturally assign two probability distributions, for nodes and for edges, which lead us directly to the definition of the entropy and joint entropy and, hence, mutual information establishing an information theory for this graph class. Furthermore, we provide some results under which conditions these constraint probability distributions maximize the corresponding entropy. Also, we demonstrate that these entropic measures can be computed efficiently which is a prerequisite for every large scale practical application and show some numerical examples. (c) 2007 Elsevier Inc. All rights reserved.

Separable Banach lattices on which every bounded linear operator is regular

We give a complete description of those separable Banach lattices E with the property that every bounded linear from E into itself is the difference of two positive operators.

Evaluation of Random Delay Insertion against DPA on FPGAs

Side-channel attacks (SCA) threaten electronic cryptographic devices and can be carried out by monitoring the physical characteristics of security circuits. Differential Power Analysis (DPA) is one the most widely studied side-channel attacks. Numerous countermeasure techniques, such as Random Delay Insertion (RDI), have been proposed to reduce the risk of DPA attacks against cryptographic devices. The RDI technique was first proposed for microprocessors but it was shown to be unsuccessful when implemented on smartcards as it was vulnerable to a variant of the DPA attack known as the Sliding-Window DPA attack.Previous research by the authors investigated the use of the RDI countermeasure for Field Programmable Gate Array (FPGA) based cryptographic devices. A split-RDI technique wasproposed to improve the security of the RDI countermeasure. A set of critical parameters wasalso proposed that could be utilized in the design stage to optimize a security algorithm designwith RDI in terms of area, speed and power. The authors also showed that RDI is an efficientcountermeasure technique on FPGA in comparison to other countermeasures.In this article, a new RDI logic design is proposed that can be used to cost-efficiently implementRDI on FPGA devices. Sliding-Window DPA and realignment attacks, which were shown to beeffective against RDI implemented on smartcard devices, are performed on the improved RDIFPGA implementation. We demonstrate that these attacks are unsuccessful and we also proposea realignment technique that can be used to demonstrate the weakness of RDI implementations.