407 research outputs found

    Enhancements of a clock-controlled running key generator

    Get PDF
    AbstractThe design of stream ciphers based on the synthesis of linear feedback shift registers (LFSRs) has been the research target of many cryptographers for more than 50 years.There is no general way for such a synthesis that results in design of a “secure” stream cipher. One of the design approaches is the use of basic design principles followed by properties testing procedures (system-theoretic approach).In our contribution we present some enhancements of the generator studied in [6], [7]. The new designed generators consist of more LFSRs, use different clocking schemes and different output functions. We discuss their cryptographic properties and security against selected known attacks on stream ciphers

    MSU Test of P-model

    Get PDF
    Results of running key station data (soil, air, and dew point temperatures, net irradiation, and wind direction and speed) from Michigan through the P-model are presented. The details of each of the 55 error calculations are shown in tables. A histogram is included showing errors in degrees Fahrenheit

    Chaotic Image Encryption Based on Running-Key Related to Plaintext

    Get PDF
    In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack

    Keeping the engine room running: key themes and developments in water resources management in the Pilbara region of Western Australia

    Get PDF
    Water management is a key issue confronting government, the mining industry and the wider community in the Pilbara region of Western Australia. This article will provide an update on three current developments in Pilbara water resource management: preparation of the Pilbara groundwater allocation plan, consideration of facilitating the on-use of mine dewatering surplus ( or excess), and preparation of a guidance note on environmental and water assessments relating to mining operations in the Fortescue Marsh area.! From these developments, we can draw three themes that appear to be guiding water resource management in the Pilbara: limited water allocation plans, diversification of water supply sources (and the associated removal of any potential legislative constraints with respect to the use of mine dewater), and management of cumulative impacts for specific areas of ecological significance. This article seeks to explore these guiding themes and identify issues that require further investigation

    Comment on "Exposed-Key Weakness of Alpha-Eta" [Phys. Lett. A 370 (2007) 131]

    Full text link
    We show that the insecurity claim of the AlphaEta cryptosystem made by C. Ahn and K. Birnbaum in Phys. Lett. A 370 (2007) 131-135 under heterodyne attack is based on invalid extrapolations of Shannon's random cipher analysis and on an invalid statistical independence assumption. We show, both for standard ciphers and AlphaEta, that expressions of the kind given by Ahn and Birnbaum can at best be interpreted as security lower bounds.Comment: Published versio
    corecore