9,302 research outputs found
Comparison analysis of stream cipher algorithms for digital communication
The broadcast nature of radio communication such as in the HF (High Frequency) spectrum exposes the transmitted information to unauthorized third parties. Confidentiality is ensured by employing cipher system. For bulk transmission of data, stream ciphers are ideal choices over block ciphers due to faster implementation speed and not introducing error propagation. The stream cipher algorithms evaluated are based on the linear feedback shift register (LFSR) with nonlinear combining function. By using a common key length and worst case conditions, the strength of several stream cipher algorithms are evaluated using statistical tests, correlation attack, linear complexity profile and nonstandard test. The best algorithm is the one that exceeds all of the tests
Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
We have formulated the problem of generating periodic dense paritcle packings
as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation
[S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the
objective function and impenetrability constraints can be exactly linearized
for sphere packings with a size distribution in -dimensional Euclidean space
, it is most suitable and natural to solve the corresponding ASC
optimization problem using sequential linear programming (SLP) techniques. We
implement an SLP solution to produce robustly a wide spectrum of jammed sphere
packings in for and with a diversity of disorder
and densities up to the maximally densities. This deterministic algorithm can
produce a broad range of inherent structures besides the usual disordered ones
with very small computational cost by tuning the radius of the {\it influence
sphere}. In three dimensions, we show that it can produce with high probability
a variety of strictly jammed packings with a packing density anywhere in the
wide range . We also apply the algorithm to generate various
disordered packings as well as the maximally dense packings for
and 6. Compared to the LS procedure, our SLP protocol is able to ensure that
the final packings are truly jammed, produces disordered jammed packings with
anomalously low densities, and is appreciably more robust and computationally
faster at generating maximally dense packings, especially as the space
dimension increases.Comment: 34 pages, 6 figure
Stability of a chain of phase oscillators
We study a chain of N + 1 phase oscillators with asymmetric but uniform coupling. This type of chain possesses 2 N ways to synchronize in so-called traveling wave states, i.e., states where the phases of the single oscillators are in relative equilibrium. We show that the number of unstable dimensions of a traveling wave equals the number of oscillators with relative phase close to π . This implies that only the relative equilibrium corresponding to approximate in-phase synchronization is locally stable. Despite the presence of a Lyapunov-type functional, periodic or chaotic phase slipping occurs. For chains of lengths 3 and 4 we locate the region in parameter space where rotations (corresponding to phase slipping) are present
- …