Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userImage Encryption Using Elliptic Curves and Rossby/Drift Wave Triads
68
0
0.0
(
0
)
Added by
Miguel D. Bustamante
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We propose an image encryption scheme based on quasi-resonant Rossby/drift wave triads (related to elliptic surfaces) and Mordell elliptic curves (MECs). By defining a total order on quasi-resonant triads, at a first stage we construct quasi-resonant triads using auxiliary parameters of elliptic surfaces in order to generate pseudo-random numbers. At a second stage, we employ an MEC to construct a dynamic substitution box (S-box) for the plain image. The generated pseudo-random numbers and S-box are used to provide diffusion and confusion, respectively, in the tested image. We test the proposed scheme against well-known attacks by encrypting all gray images taken from the USC-SIPI image database. Our experimental results indicate the high security of the newly developed scheme. Finally, via extensive comparisons we show that the new scheme outperforms other popular schemes.
rate research
Read More
Linear wave solutions to the Charney-Hasegawa-Mima partial differential equation with periodic boundary conditions have two physical interpretations: Rossby (atmospheric) waves, and drift (plasma) waves in a tokamak. These waves display resonance in triads. In the case of infinite Rossby deformation radius, the set of resonant triads may be described as the set of integer solutions to a particular homogeneous Diophantine equation, or as the set of rational points on a projective surface. We give a rational parametrization of the smooth points on this surface, answering the question: What are all resonant triads? We also give a fiberwise description, yielding a procedure to answer the question: For fixed $r in mathbb{Q}$, what are all wavevectors $(x,y)$ that resonate with a wavevector $(a,b)$ with $a/b = r$?
We report results on the explicit parameterisation of discrete Rossby-wave resonant triads of the Charney-Hasegawa-Mima equation in the small-scale limit (i.e. large Rossby deformation radius), following up from our previous solution in terms of elliptic curves (Bustamante and Hayat, 2013). We find an explicit parameterisation of the discrete resonant wavevectors in terms of two rational variables. We show that these new variables are restricted to a bounded region and find this region explicitly. We argue that this can be used to reduce the complexity of a direct numerical search for discrete triad resonances. Also, we introduce a new direct numerical method to search for discrete resonances. This numerical method has complexity ${mathcal{O}}(N^3)$, where $N$ is the largest wavenumber in the search. We apply this new method to find all discrete irreducible resonant triads in the wavevector box of size $5000$, in a calculation that took about $10.5$ days on a $16$-core machine. Finally, based on our method of mapping to elliptic curves, we discuss some dynamical implications regarding the spread of quadratic invariants across scales via resonant triad interactions, in the form of sharp bounds on the size of the interacting wavevectors.
In this paper, a word based chaotic image encryption scheme for gray images is proposed, that can be used in both synchronous and self-synchronous modes. The encryption scheme operates in a finite field where we have also analyzed its performance according to numerical precision used in implementation. We show that the scheme not only passes a variety of security tests, but also it is verified that the proposed scheme operates faster than other existing schemes of the same type even when using lightweight short key sizes.
Let $K$ be a field of characteristic different from $2$, $bar{K}$ its algebraic closure. Let $n ge 3$ be an odd prime such that $2$ is a primitive root modulo $n$. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider genus $(n-1)/2$ hyperelliptic curves $C_f: y^2=f(x)$ and $C_h: y^2=h(x)$, and their jacobians $J(C_f)$ and $J(C_h)$, which are $(n-1)/2$-dimensional abelian varieties defined over $K$. Suppose that one of the polynomials is irreducible and the other reducible. We prove that if $J(C_f)$ and $J(C_h)$ are isogenous over $bar{K}$ then both jacobians are abelian varieties of CM type with multiplication by the field of $n$th roots of $1$.
This work proposes a different procedure to encrypt images of 256 grey levels and colour, using the symmetric system Advanced Encryption Standard with a variable permutation in the first round, after the x-or operation. Variable permutation means using a different one for each input block of 128 bits. In this vein, an algorithm is constructed that defines a Bijective function between sets Nm = {n in N, 0 <= n < fac(m)} with n >= 2 and Pm = {pi, pi is a permutation of 0, 1, ..., m-1}. This algorithm calculates permutations on 128 positions with 127 known constants. The transcendental numbers are used to select the 127 constants in a pseudo-random way. The proposed encryption quality is evaluated by the following criteria: Correlation; horizontal, vertical and diagonal, Entropy and Discrete Fourier Transform. The latter uses the NIST standard 800-22. Also, a sensitivity analysis was performed in encrypted figures. Furthermore, an additional test is proposed which considers the distribution of 256 shades of the three colours; red, green and blue for colour images. On the other hand, it is important to mention that the images are encrypted without loss of information because many banking companies and some safety area countries do not allow the figures to go through a compression process with information loss. i.e., it is forbidden to use formats such as JPEG.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
