A Comparison between odd magic squares use in cryptographic algorithms.

This paper has been developed to compare encryption algorithms based on individual magic squares and discuss the advantages and disadvantages of each algorithm or method. Where some positions of the magic square are assigned to the key and the remaining positions are assigned to the message, then the rows, columns and diagonals are summed and these results are as ciphertext and in the process of decryption the equations are arranged and solved by Gauss elimination metod. All algorithms were applied to encrypte the text and images, as well as using both GF(P) and GF(28), and the speed and complexity were calculated. The speed of MS9 by using GF(P) is 15.09085 Millie Second, while by using GF(28) it will be 18.94268 Millie Second, and the complexity is the value of the ASCII code raised to the exponent of the number of message locations multiplied by the value of the prime number raised to the exponent of the number of key locations.

Alphabets and “Calligraphy” in the Section on Prayers, Special Characteristics of the Quran and Magic Squares in the Inventory of Sultan Bayezid II’s Palace Library

This essay is an attempt to read the section on invocations, prayers, the unique qualities of the Quran and magic squares of the palace library of the Ottoman Sultan Bayezid II (d. 918/1512) along with several works by ʿAbd al-Raḥmān al-Bisṭāmī (d. c. 858/1454 or 1455) to cast light on underexamined perceptions of calligraphic styles and alphabets/scripts employed to inscribe talismanic objects and manuscripts. Methodologically, the intention is to situate the inventory of the palace library in the intersection of prescriptive texts, on the one hand, and talismanic objects and manuscripts of invocations, on the other. By taking the inventory as a document of practice, the essay seeks to illustrate the importance of paying attention to other elements of the talismanic compound in general, and to the use of alphabets/scripts with their specific talismanic attributes in particular.

Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy

Symmetry forms the foundation of combinatorial theories and algorithms of enumeration such as Möbius inversion, Euler totient functions, and the celebrated Pólya’s theory of enumeration under the symmetric group action. As machine learning and artificial intelligence techniques play increasingly important roles in the machine perception of music to image processing that are central to many disciplines, combinatorics, graph theory, and symmetry act as powerful bridges to the developments of algorithms for such varied applications. In this review, we bring together the confluence of music theory and spectroscopy as two primary disciplines to outline several interconnections of combinatorial and symmetry techniques in the development of algorithms for machine generation of musical patterns of the east and west and a variety of spectroscopic signatures of molecules. Combinatorial techniques in conjunction with group theory can be harnessed to generate the musical scales, intensity patterns in ESR spectra, multiple quantum NMR spectra, nuclear spin statistics of both fermions and bosons, colorings of hyperplanes of hypercubes, enumeration of chiral isomers, and vibrational modes of complex systems including supergiant fullerenes, as exemplified by our work on the golden fullerene C150,000. Combinatorial techniques are shown to yield algorithms for the enumeration and construction of musical chords and scales called ragas in music theory, as we exemplify by the machine construction of ragas and machine perception of musical patterns. We also outline the applications of Hadamard matrices and magic squares in the development of algorithms for the generation of balanced-pitch chords. Machine perception of musical, spectroscopic, and symmetry patterns are considered.

Establishing Infinite Methods of Construction of Magic Squares

Here we have established infinite methods of building doubly even magic squares from doubly even magic squares of n order (n ≥ 20) which are formed by blocks of order four whose sums of elements of lines, columns and diagonals are all equal at 2n2 + 2. Such a characteristic of these special magic squares causes a large production of other magic squares.