Algebraic break of image ciphers based on discretized chaotic map lattices

In this paper, we provide an algebraic cryptanalysis of a recently proposed chaotic image cipher. We show that the secret parameters of the algorithm can be revealed using chosen-plaintext attacks. Our attack uses the orbit properties of the permutation maps to deduce encryption values for a single round. Once a single round encryption is revealed, the secret parameters are obtained using simple assignments.This work was supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Project No. 106E143Publisher's VersionAuthor Post Prin

An Improved Self-Embedding Algorithm: Digital Content Protection against Compression Attacks in Digital Watermarking

Summary. Lossy compression attacks in digital watermarking are one of the major issues in digital watermarking. Cheddad et al. proposed a robust secured selfembedding method which is resistant to a certain amount of JPEG compression. Our experimental results show that the self-embedding method is resistant to JPEG compression attacks and not resistant to other lossy compression attacks such as Block Truncation Coding (BTC) and Singular Value Decomposition (SVD). Therefore we improved Cheddad et al's. method to give better protection against BTC and SVD compression attacks

Security: Hash Function-authentications

As security or firewall administrator, we got basically the same concerns (as a plumber) the size of the pipe the contents of the pipe, making sure the correct traffic is in the correct pipes and keeping the pipes from splitting and leaking all over the places of course like plumbers. When the pipes do leak: we are the ones responsible for cleaning up the mess and we are the ones who come up smelling awful. Firewall is a device that is used to provide protection to a system from network-based security threats. The firewall uses service, behavior, user and direction control techniques

When Open Source Software Encounters Patents: Blockchain as an Example to Explore the Dilemma and Solutions, 18 J. Marshall Rev. Intell. Prop. L. 55 (2018)

The original blockchain developers set the core programs, development interfaces, and application software of the blockchain as open source software, which are open to all developers for free. They have never thought of collecting royalties by claiming copyright, nor did they apply for patents. Since then, however, many follow-up blockchain developers applied the core programs to further developments and filed a large numbers of patent applications, causing the original blockchain developers to be very concerned about whether these patents will otherwise slow down or even endanger the innovation of blockchain technology. Consequently, finding legal solutions for the conflicts between open source software and patent rights hence becomes an important research topic in the field of intellectual property rights. This article discusses three possible solutions to the conflict: the licensing schemes of industrial standard, the licensing schemes of open source software, and the open patent campaigns, pointing out that at the moment all three have an opportunity to solve the problem, while also acknowledging that there are still many issues to be solved. In terms of the licensing schemes of industrial standard, this article considers that the industrial standard of blockchain should require the patentees involved in standard setting to disclose their patents, and should require the owners of the standard essential patents to not refuse the patent licensing. To determine what licensing scheme the blockchain standard should adopt, this article conducts a legal and economic analysis by studying its technical attributes, the process of patent thicketing, and the development of the industry, suggesting that the “Patent Policy” of the blockchain standard should at least follow the fair, reasonable, and non-discriminatory (FRAND) license adopted by many industrial standards such as the telecommunication industry. As a result, users of blockchain could access the patented technologies more conveniently. In terms of the licensing schemes of open source software, this article finds that the MIT license for the Bitcoin Blockchain and the GNU GPL license for the Ethereum Blockchain cannot solve the problem of follow-up developers not drafting a software code, but instead applying for patents for the resulting follow-up developments. This article compares the similarities and differences of other open source software programs, studies the original philosophical spirit and technological and industrial development of blockchains, and suggests a suitable licensing scheme of open source software for the blockchain technology. Lastly, this article finds open patents to be a possible solution to the patent problems faced by the blockchain technology, but concludes that this solution is more challenging with blockchain than in other industries because open patent campaigns rely on the spontaneous action of the patentee. The blockchain industry, especially the original developers of the core blockchain technology, should provide incentives for the right holders of subsequent patent applications to willingly and spontaneously open their patents

Une fonction de hachage basée sur la théorie du chaos

Ce mémoire présente une brève introduction aux fonctions de hachage : les principales fonctions de hachage utilisées ainsi que leurs principales utilisations. Une nouvelle fonction de hachage, développée par Yong Wang , Xiaofeng Liao, Di Xao et Kwok-Wo Wong [1], sera introduite et une modification de cette dernière sera proposée. Cette fonction de hachage est basée sur un système dynamique chaotique, ce qui conduit à l'étude des exposants de Lyapunov

Analysis and Design Security Primitives Based on Chaotic Systems for eCommerce

Security is considered the most important requirement for the success of electronic commerce, which is built based on the security of hash functions, encryption algorithms and pseudorandom number generators. Chaotic systems and security algorithms have similar properties including sensitivity to any change or changes in the initial parameters, unpredictability, deterministic nature and random-like behaviour. Several security algorithms based on chaotic systems have been proposed; unfortunately some of them were found to be insecure and/or slow. In view of this, designing new secure and fast security algorithms based on chaotic systems which guarantee integrity, authentication and confidentiality is essential for electronic commerce development. In this thesis, we comprehensively explore the analysis and design of security primitives based on chaotic systems for electronic commerce: hash functions, encryption algorithms and pseudorandom number generators. Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed. The securities of the proposed algorithms are analyzed based on some well-know statistical tests in this filed. In addition, a new one-dimensional triangle-chaotic map (TCM) with perfect chaotic behaviour is presented. We have compared the proposed chaos-based hash functions, block cipher and pseudorandom number generator with well-know algorithms. The comparison results show that the proposed algorithms are better than some other existing algorithms. Several analyses and computer simulations are performed on the proposed algorithms to verify their characteristics, confirming that these proposed algorithms satisfy the characteristics and conditions of security algorithms. The proposed algorithms in this thesis are high-potential for adoption in e-commerce applications and protocols