34356476
Polyphase sequence with low autocorrelations
It is proved that Golomb sequences have perfect periodic autocorrelation. It is also proved that the magnitudes of the out-of-phase aperiodic autocorrelation values of Golomb sequences of length L for all L>or=14 are bounded by square root (L/3). It is shown that B/sub g/(L) is asymptotic to square root (L/c) (where c approximately=4.348. . .), as L goes to infinity. >
43179362
On the crosscorrelation of generalized Barker sequences
Some communication systems require sets of signals in which each signal can be easily distinguished from all time-shifted versions of itself, and from every other signal in the set. A generalized Barker sequence can be easily distinguished from the time-shifted versions of itself. It is shown that distinguishing between a generalized Barker sequence and any other generalized Barker sequence of the same length is inherently harder than distinguishing the sequence from time-shifted versions of itself. >
29554681
Uniqueness of the generalized Barker sequence of length 6
It is proven that there is a unique generalized Barker sequence of length 6, modulo the group of Barker-preserving transformations. >
28414698
A limit theorem for n-phase Barker sequences (corresp.)
It is proved that for 3lLl19, except for L =6, the total number of normalized n-phase Barker sequences of length L increases without limit as n goes to infinity
37809849
Sixty-phase generalized Barker sequences
The extension of the list of known generalized Barker sequences to length 19 is proposed. Examples for all lengths up to 19 where the terms of the sequence are sixtieth roots of unity are given. >
18850818
A Fast Algorithm for the Chirp Rate Estimation
A fast algorithm for the chirp rate estimation is presented in this paper. By the computation of the cubic phase transform (CPT) of the signal, it is shown that the CPT is concentrated along the frequency rate law of the signal, and the peak of the CPT yields the estimate of the chirp rate. The proposed algorithm is fast in that it requires only one-dimensional (1-D) maximizations. The asymptotic statistical result is derived for the chirp rate estimation, and the computer simulation demonstrates that, when the input signal-to-noise ratio (SNR) is higher than -2 dB, the simulation results and the theoretical analyses are well matched, and the mean-square error (MSE) approaches optimality as the SNR tends to infinity.
19035631
A New Secure Binding Management Protocol for Mobile IPv6 Networks
This paper proposes a novel secure binding management protocol for mobile IPv6 networks for use in the implementation of routing optimization. The idea uses the public key of the home network of a mobile node to cryptographically generate the mobile node's home address and the associated private key to sign the mobile node's authentication requests. In addition, the proposed protocol performs reachability tests for both the home address and the care-of address. The proposed protocol offloads all expensive cryptographic operations from a mobile node to its home agent. The security of the protocol is informally analysed and an initially evaluation of its performance given.
7396264
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
We investigate an upper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate that these sequences may have `nice' pseudo-random properties. The important tool in the proof is certain character sums estimate along elliptic curves. In addition, we apply linear recurrence relation over elliptic curves to output binary sequences with very interesting pseudo-random behavior.
5631107
Compact Access Control Labeling for Efficient Secure XML Query Evaluation
Fine-grained access controls for XML define access privileges at the granularity of individual XML nodes. In this paper, we present a fine-grained access control mechanism for XML data. This mechanism exploits the structural locality of access rights as well as correlations among the access rights of different users to produce a compact physical encoding of the access control data. This encoding can be constructed using a single pass over a labeled XML database. It is block-oriented and suitable for use in secondary storage. We show how this access control mechanism can be integrated with a next-of-kin (NoK) XML query processor to provide efficient, secure query evaluation. The key idea is that the structural information of the nodes and their encoded access controls are stored together so the access privileges can be checked efficiently. Our evaluation shows that the access control mechanism introduces little overhead into the query evaluation process.
13573453
A general approach to secure components composition
At present, security properties for components composition have two major shortcomings. First, they do not properly consider connectivity between components. This leads to the imposition of over strong security requirements on the components. Consequently their functionality and performance may be sacrificed unnecessarily. Secondly, these properties usually demand components and their system to comply with the same or compatible security requirements. This greatly restricts their applicability. To rectify these problems, we aim to present a composable security property that permits different components to meet different security requirements, and appropriately enforces the requirements on the components with regard to their connectivity.