1 September 2021 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Chaos-based image encryption schemes have been extensively employed over the past few years. Many issues such as the dynamical degradation of digital chaotic systems and information security have been explored, and plenty of successful solutions have also been proposed. However, the impact of finite precision in different hardware and software setups has received little attention. In this work, we have shown that the finite precision error may produce distinct cipher-images on different devices. In order to overcome this problem, we introduce an efficient cryptosystem, in which the chaotic logistic map and the Galois field theory are applied. Our approach passes in the ENT test suite and in several cyberattacks. It also presents an astonishing key space of up to . Benchmark images have been effectively encrypted and decrypted using dissimilar digital devices.
1 January 2020 in Advances in Mathematics of Communications
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, Abelian orbit codes are defined and a construction of Abelian non-cyclic orbit codes is presented. In order to analyze their structures, the concept of geometrically uniform partitions have to be reinterpreted. As a consequence, a substantial reduction in the number of computations needed to obtain the minimum subspace distance of these codes is achieved and established. An application of orbit codes to multishot subspace codes obtained according to a multi-level construction is provided.
13 August 2021 in Journal of Algebra and Its Applications
3 November 2020 in São Paulo Journal of Mathematical Sciences
In this paper, we propose a way to partition any linear cyclic code in its cyclic equivalence classes according to the algebraic structure of the code. Such partition is useful to generate cyclically permutable codes directly from linear cyclic codes. We consider the case where the size of the finite field and the block length of the code are coprimes. Moreover, we present a criterion to construct maximal cyclic order codes.
20 December 2024 in Designs, Codes and Cryptography
31 August 2025 in Designs, Codes and Cryptography