No abstract

No abstract

We consider the set of Diophantine equations that arise in the context of the partial differential equation called "barotropic vorticity equation" on periodic domains, when nonlinear wave interactions are studied to leading order in the amplitudes. The solutions to this set of Diophantine equations are of interest in atmosphere (Rossby waves) and Tokamak plasmas (drift waves), because they provide the values of the spectral wavevectors that interact resonantly via three-wave interactions. These wavenumbers come in "triads", i.e., groups of three wavevectors.We provide the full solution to the Diophantine equations in the physically sensible limit when the Rossby deformation radius is infinite. The method is completely new, and relies on mapping the unknown variables via rational transformations, first to rational points on elliptic curves and surfaces, and from there to rational points on quadratic forms of "Minkowski" type (such as the familiar space-time in special relativity). Classical methods invented centuries ago by Fermat, Euler, Lagrange, Minkowski, are used to classify all solutions to our original Diophantine equations, thus providing a computational method to generate numerically all the resonant triads in the system. Computationally speaking, our method has a clear advantage over brute-force numerical search: on a 10000 2 grid, the brute-force search would take 15 years using optimised C ++ codes on a cluster, whereas our method takes about 40 minutes using a laptop.Moreover, the method is extended to generate so-called quasi-resonant triads, which are defined by relaxing the resonant condition on the frequencies, allowing for a small mismatch. Quasi-resonant triads' distribution in wavevector space is robust with respect to physical perturbations, unlike resonant triads' distribution. Therefore, the extended method is really valuable in practical terms. We show that the set of quasi-resonant triads form an intricate network of connected triads, forming clusters whose structure depends on the value of the allowed mismatch. It is believed that understanding this network is absolutely relevant to understanding turbulence. We provide some quantitative comparison between the clusters' structure and the onset of fully nonlinear turbulent regime in the barotropic vorticity equation, and we provide perspectives for new research.

Elliptic curves (ECs) are considered as one of the highly secure structures against modern computational attacks. In this paper, we present an efficient method based on an ordered isomorphic EC for the generation of a large number of distinct, mutually uncorrelated, and cryptographically strong injective S-boxes. The proposed scheme is characterized in terms of time complexity and the number of the distinct S-boxes. Furthermore, rigorous analysis and comparison of the newly developed method with some of the existing methods are conducted. Experimental results reveal that the newly developed scheme can efficiently generate a large number of distinct, uncorrelated, and secure S-boxes when compared with some of the well-known existing schemes.

Elliptic curve cryptography (ECC) is used in many security systems due to its small key size and high security as compared to the other cryptosystems. In many well-known security systems substitution box (S-box) is the only non-linear component. Recently, it is shown that the security of a cryptosystem can be improved by using dynamic S-boxes instead of a static S-box. This fact necessitates the construction of new secure S-boxes. In this paper, we propose an efficient method for the generation of S-boxes based on a class of Mordell elliptic curves (MECs) over prime fields by defining different total orders. The proposed scheme is developed in such a way that for each input it outputs an S-box in linear time and constant space. Due to this property, our method takes less time and space as compared to all existing S-box construction methods over elliptic curve. Furthermore, it is shown by the computational results that the proposed method is capable of generating cryptographically strong S-boxes with comparable security to some of the existing S-boxes constructed over different mathematical structures.