Scientific Tamil Lexicon: The Revelation of Cryptographic Connection Between Tamil Language and Galois Field

This paper presents a computational framework that helps enhance the confidentiality protection of communication in cybersecurity by leveraging the scientific properties of the Tamil language and the advanced encryption standard (AES). It defines a product set of vowels and consonants sounds of the Tamil language and reveals its connection to Hardy-Ramanujan prime factors and Tamil letters as a one-to-one function. It also reveals that the letters of the Tamil alphabet, combined with the digits from 1 to 9, form a Galois field of 2^8 over an irreducible polynomial of degree 8. In addition, it implements these two mathematical properties and builds an encoder for the AES algorithm to transform the Tamil texts to their hexadecimal states, and replace the pre-round transformation module of AES. It empirically shows that the Tamil-based encoder enhances the cryptographic strength of the AES algorithm at every step of its encryption flow. The cryptographic strength is measured by the runs test scores of the bit sequences of the ciphers of AES and compared with that of the English language. This modeling and simulation approach concludes that the Tamil-based encryption enhances the cryptographic strength of AES than English-based encryption.

On the Eventually Periodic Continued β-Fractions and Their Lévy Constants

In this paper, we consider continued β-fractions with golden ratio base β. We show that if the continued β-fraction expansion of a non-negative real number is eventually periodic, then it is the root of a quadratic irreducible polynomial with the coefficients in Z[β] and we conjecture the converse is false, which is different from Lagrange’s theorem for the regular continued fractions. We prove that the set of Lévy constants of the points with eventually periodic continued β-fraction expansion is dense in [c, +∞), where c=12logβ+2−5β+12.

On the least common multiple of polynomial sequences at prime arguments

Cilleruelo conjectured that if [Formula: see text] is an irreducible polynomial of degree [Formula: see text] then, [Formula: see text] In this paper, we investigate the analog of prime arguments, namely, [Formula: see text] where [Formula: see text] denotes a prime and obtain nontrivial lower bounds on it. Further, we also show some results regarding the greatest prime divisor of [Formula: see text]

Generalized Galois-Fibonacci Matrix Generators Pseudo-Random Sequences

The article discusses various options for constructing binary generators of pseudo-random numbers (PRN) based on the so-called generalized Galois and Fibonacci matrices. The terms "Galois matrix" and "Fibonacci matrix" are borrowed from the theory of cryptography, in which the linear feedback shift registers (LFSR) generators of the PRN according to the Galois and Fibonacci schemes are widely used. The matrix generators generate identical PRN sequences as the LFSR generators. The transition from classical to generalized matrix PRN generators (PRNG) is accompanied by expanding the variety of generators, leading to a significant increase in their cryptographic resistance. This effect is achieved both due to the rise in the number of elements forming matrices and because generalized matrices are synthesized based on primitive generating polynomials and polynomials that are not necessarily primitive. Classical LFSR generators of PRN (and their matrix equivalents) have a significant drawback: they are susceptible to Berlekamp-Messi (BM) attacks. Generalized matrix PRNG is free from BM attack. The last property is a consequence of such a feature of the BM algorithm. This algorithm for cracking classical LFSR generators of PRN solves the problem of calculating the only unknown – a primitive polynomial generating the generator. For variants of generalized matrix PRNG, it becomes necessary to determine two unknown parameters: both an irreducible polynomial and a forming element that produces a generalized matrix. This problem turns out to be unsolvable for the BM algorithm since it is designed to calculate only one unknown parameter. The research results are generalized for solving PRNG problems over a Galois field of odd characteristics.

Construction of irreducible polynomials over finite fields

Irreducible polynomials over finite fields and their applications have been quite well studied. Here, we discuss the construction of the irreducible polynomials of degree [Formula: see text] over the finite field [Formula: see text] for a given irreducible polynomial of degree [Formula: see text]. Furthermore, we construct the irreducible polynomials of degree [Formula: see text] over the finite field [Formula: see text] for a given irreducible polynomial of degree [Formula: see text] by using the method of composition of polynomials with some conditions on coefficients and degree of a given irreducible polynomial.

On Power Integral Bases for Certain Pure Number Fields Defined by x 36 − m

Let K = ℚ(α) be a number field generated by a complex root a of a monic irreducible polynomial ƒ (x) = x36 − m, with m ≠ ±1 a square free rational integer. In this paper, we prove that if m ≡ 2 or 3 (mod 4) and m ≠ ±1 (mod 9) then the number field K is monogenic. If m ≡ 1 (mod 4) or m ≡±1 (mod 9), then the number field K is not monogenic.

On monogenity of certain pure number fields defined by xpr − m

Let [Formula: see text] be a pure number field generated by a complex root [Formula: see text] of a monic irreducible polynomial [Formula: see text] where [Formula: see text] is a square free rational integer, [Formula: see text] is a rational prime integer, and [Formula: see text] is a positive integer. In this paper, we study the monogenity of [Formula: see text]. We prove that if [Formula: see text], then [Formula: see text] is monogenic. But if [Formula: see text] and [Formula: see text], then [Formula: see text] is not monogenic. Some illustrating examples are given.

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

We have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. Nowadays, the chaotic cryptosystems gained more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, there are many encryption algorithms that can simply guarantees security while the schemes based on chaotic systems only promises the uncertainty, both of them can not encounter the needs of current scenario. To tackle this issue, this article proposed an image encryption algorithm based on Lorenz chaotic system and primitive irreducible polynomial substitution box. First, we have proposed 16 different S-boxes based on projective general linear group and 16 primitive irreducible polynomials of Galois field of order 256, and then utilized these S-boxes with combination of chaotic map in image encryption scheme. Three chaotic sequences can be produced by the disturbed of Lorenz chaotic system corresponding to variables x, y and z. We have constructed a new pseudo random chaotic sequence ki based on x, y and z. The plain image is encrypted by the use of chaotic sequence ki and XOR operation to get a ciphered image. To show the strength of presented image encryption, some renowned analyses are performed.