3,448 research outputs found

    Comparison analysis of stream cipher algorithms for digital communication

    Get PDF
    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

    Imaging time series for the classification of EMI discharge sources

    Get PDF
    In this work, we aim to classify a wider range of Electromagnetic Interference (EMI) discharge sources collected from new power plant sites across multiple assets. This engenders a more complex and challenging classification task. The study involves an investigation and development of new and improved feature extraction and data dimension reduction algorithms based on image processing techniques. The approach is to exploit the Gramian Angular Field technique to map the measured EMI time signals to an image, from which the significant information is extracted while removing redundancy. The image of each discharge type contains a unique fingerprint. Two feature reduction methods called the Local Binary Pattern (LBP) and the Local Phase Quantisation (LPQ) are then used within the mapped images. This provides feature vectors that can be implemented into a Random Forest (RF) classifier. The performance of a previous and the two new proposed methods, on the new database set, is compared in terms of classification accuracy, precision, recall, and F-measure. Results show that the new methods have a higher performance than the previous one, where LBP features achieve the best outcome

    Optimal PMU Placement for Power System Dynamic State Estimation by Using Empirical Observability Gramian

    Get PDF
    In this paper the empirical observability Gramian calculated around the operating region of a power system is used to quantify the degree of observability of the system states under specific phasor measurement unit (PMU) placement. An optimal PMU placement method for power system dynamic state estimation is further formulated as an optimization problem which maximizes the determinant of the empirical observability Gramian and is efficiently solved by the NOMAD solver, which implements the Mesh Adaptive Direct Search (MADS) algorithm. The implementation, validation, and also the robustness to load fluctuations and contingencies of the proposed method are carefully discussed. The proposed method is tested on WSCC 3-machine 9-bus system and NPCC 48-machine 140-bus system by performing dynamic state estimation with square-root unscented Kalman filter. The simulation results show that the determined optimal PMU placements by the proposed method can guarantee good observability of the system states, which further leads to smaller estimation errors and larger number of convergent states for dynamic state estimation compared with random PMU placements. Under optimal PMU placements an obvious observability transition can be observed. The proposed method is also validated to be very robust to both load fluctuations and contingencies.Comment: Accepted by IEEE Transactions on Power System

    Cryptanalysis of LFSR-based Pseudorandom Generators - a Survey

    Full text link
    Pseudorandom generators based on linear feedback shift registers (LFSR) are a traditional building block for cryptographic stream ciphers. In this report, we review the general idea for such generators, as well as the most important techniques of cryptanalysis

    Algebraic Attacks on Summation Generators

    Get PDF
    We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses nn LFSRs, the algebraic equation relating the key stream bits and LFSR output bits can be made to be of degree less than or equal to 2log2n2^{\lceil\log_2 n \rceil}, using log2n+1\lceil\log_2 n \rceil + 1 consecutive key stream bits. This is much lower than the upper bound given by previous general results
    corecore