Magic squares of squares over a finite field

Author(s):  
Stewart Hengeveld ◽  
Giancarlo Labruna ◽  
Aihua Li

A magic square M M over an integral domain D D is a 3 × 3 3\times 3 matrix with entries from D D such that the elements from each row, column, and diagonal add to the same sum. If all the entries in M M are perfect squares in D D , we call M M a magic square of squares over D D . In 1984, Martin LaBar raised an open question: “Is there a magic square of squares over the ring Z \mathbb {Z} of the integers which has all the nine entries distinct?” We approach to answering a similar question when D D is a finite field. We claim that for any odd prime p p , a magic square over Z p \mathbb Z_p can only hold an odd number of distinct entries. Corresponding to LaBar’s question, we show that there are infinitely many prime numbers p p such that, over Z p \mathbb Z_p , magic squares of squares with nine distinct elements exist. In addition, if p ≡ 1 ( mod 120 ) p\equiv 1\pmod {120} , there exist magic squares of squares over Z p \mathbb Z_p that have exactly 3, 5, 7, or 9 distinct entries respectively. We construct magic squares of squares using triples of consecutive quadratic residues derived from twin primes.

Author(s):  
Sahab Dheyaa Mohammed ◽  
Taha Mohammed Hasan

<p>Hackers should be prevented from disclosing sensitive data when sent from one device to another over the network. Therefore, the proposed method was established to prevent the attackers from exploiting the vulnerabilities of the redundancy in the ciphertext and enhances the substitution and permutation operations of the encryption process .the solution was performed by eliminates these duplicates by hiding the ciphertext into a submatrix 4 x4 that chooses randomly from magic square 16x16 in each ciphering process. Two techniques of encrypted and hiding were executed in the encryption stage by using a magic square size 3 × 3   and Latin square size 3 × 3 to providing more permutation and also to ensure an inverse matrix of decryption operation be available. In the hiding stage, the ciphertext was hidden into a 16×16 matrix that includes 16 sub-magic squares to eliminate the duplicates in the ciphertext. Where all elements that uses were polynomial numbers of a finite field of degree Galois Fields GF ( ).  The proposed technique is robust against disclosing the repetition encrypted data based on the result of Avalanche Effect in an accepted ratio (62%) and the results of the output of the proposed encryption method have acceptable randomness based on the results of the p-values (0.629515) of the National Institute of Standards and Technology (NIST) randomness tests. The work can be considered significant in the field of encrypting databases because the repetition of encrypted data inside databases is considered an important vulnerability that helps to guess the plaintext from the encrypted text.</p>


Integers ◽  
2012 ◽  
Vol 12 (4) ◽  
Author(s):  
Christian Aebi ◽  
Grant Cairns

Abstract.We determine the product of the invertible quadratic residues in


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Anita Philips ◽  
Jayakumar Jayaraj ◽  
Josh F.T. ◽  
Venkateshkumar P.

Purpose Digitizing of the electrical power grid promotes the advantages of efficient energy management alongside the possibilities of major vulnerabilities. A typical inadequacy that needs critical attention to ensure the seamless operation of the smart grid system remains in the data transmission between consumer premises smart devices and the utility centres. Many researches aim at establishing security protocols to ensure secure and efficient energy management resulting in perfect demand–supply balance. Design/methodology/approach In this paper, the authentication of the smart meter data has been proposed with enhanced Rivest–Shamir–Adleman (RSA) key encryption using an efficient way of generating large prime numbers. The trapdoor one-way function applied in the RSA algorithm makes it almost impossible for the reverse engineering attempts of cracking the key pair. Findings The algorithm for generating prime numbers has been tested both with the convention method and with the enhanced method of including a low-level primality test with a first few hundred primes. The combination of low-level and high-level primality tests shows an improvement in execution time of the algorithm. Originality/value There is a considerable improvement in the time complexities when using the combination method. This efficient generation of prime numbers can be successfully applied to the smart meter systems, thereby increasing the strength and speed of the key encryption.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Daniele Bartoli ◽  
Maria Montanucci ◽  
Fernando Torres

Abstract Let 𝔽 be the finite field of order q 2. It is sometimes attributed to Serre that any curve 𝔽-covered by the Hermitian curve H q + 1 : y q + 1 = x q + x ${{\mathcal{H}}_{q+1}}:{{y}^{q+1}}={{x }^{q}}+x$ is also 𝔽-maximal. For prime numbers q we show that every 𝔽-maximal curve x $\mathcal{x}$ of genus g ≥ 2 with | Aut(𝒳) | > 84(g − 1) is Galois-covered by H q + 1 . ${{\mathcal{H}}_{q+1}}.$ The hypothesis on | Aut(𝒳) | is sharp, since there exists an 𝔽-maximal curve x $\mathcal{x}$ for q = 71 of genus g = 7 with | Aut(𝒳) | = 84(7 − 1) which is not Galois-covered by the Hermitian curve H 72 . ${{\mathcal{H}}_{72}}.$


2020 ◽  
Vol 35 (29) ◽  
pp. 2050183
Author(s):  
Yuta Hyodo ◽  
Teruyuki Kitabayashi

The magic texture is one of the successful textures of the flavor neutrino mass matrix for the Majorana type neutrinos. The name “magic” is inspired by the nature of the magic square. We estimate the compatibility of the magic square with the Dirac, instead of the Majorana, flavor neutrino mass matrix. It turned out that some parts of the nature of the magic square are appeared approximately in the Dirac flavor neutrino mass matrix and the magic squares prefer the normal mass ordering rather than the inverted mass ordering for the Dirac neutrinos.


2019 ◽  
Vol 40 (5) ◽  
pp. 21-27 ◽  
Author(s):  
Mark Lehrer ◽  
Stefan Schmid

Purpose This paper aims to explore hidden wellsprings of risk-taking in family firms. Design/methodology/approach The high tolerance for risk shown repeatedly by the famous family firm Hipp of Germany is documented. Three major risk-taking episodes at Hipp are examined. Findings Counterintuitively, conservative values were actually a major facilitator of risk-taking at Hipp. Research limitations/implications The ramifications for other family firms, especially in Germany’s so-called Mittelstand, are examined. An open question is whether the relevant scope of the foregoing analysis may be confined to national contexts like German Mittelstand with its highly developed sector of family firms. Practical implications Contrary to received wisdom, family firms with conservative values may actually have certain advantages in their capacity not only to assume certain types of risks but also to mitigate such risks. Especially the communitarian embeddedness of such values may provide a layer of risk mitigation. Social implications At least in some countries, such as Germany, family firms are indeed willing to engage in substantial risk-taking. With their approach of combining conservative values and risk-taking, they contribute to considerable wealth and societal development. Originality/value Conservatism in management and risk-taking propensity are usually thought of as antipodes. However, it is necessary to distinguish between conservatism (which usually equates to risk aversion) and conservative values (which, as shown, may be highly compatible with a willingness to engage and succeed in risky undertakings).


2012 ◽  
Vol 78 (7) ◽  
pp. 2465-2469 ◽  
Author(s):  
Manuela Centanni ◽  
Simone Bergmann ◽  
Silvia Turroni ◽  
Sven Hammerschmidt ◽  
Gursharan Singh Chhatwal ◽  
...  

ABSTRACTThe capacity to intervene with the host plasminogen system has recently been considered an important component in the interaction process betweenBifidobacterium animalissubsp.lactisand the human host. However, its significance in the bifidobacterial microecology within the human gastrointestinal tract is still an open question. Here we demonstrate that human plasminogen favors theB. animalissubsp.lactisBI07 adhesion to HT29 cells. Prompting the HT29 cell capacity to activate plasminogen, tumor necrosis factor alpha (TNF-α) modulated the plasminogen-mediated bacterium-enterocyte interaction, reducing the bacterial adhesion to the enterocytes and enhancing migration to the luminal compartment.


2017 ◽  
Vol 5 (1) ◽  
pp. 82-96 ◽  
Author(s):  
Xiaoyang Ma ◽  
Kai-tai Fang ◽  
Yu hui Deng

Abstract In this paper we propose a new method, based on R-C similar transformation method, to study classification for the magic squares of order 5. The R-C similar transformation is defined by exchanging two rows and related two columns of a magic square. Many new results for classification of the magic squares of order 5 are obtained by the R-C similar transformation method. Relationships between basic forms and R-C similar magic squares are discussed. We also propose a so called GMV (generating magic vector) class set method for classification of magic squares of order 5, presenting 42 categories in total.


1974 ◽  
Vol 21 (5) ◽  
pp. 439-441
Author(s):  
David L. Pagni

A magic square of nth order is a square array of n rows and n columns whose components are n^2 distinct integers. Furthermore, the sum of the numbers in any row, column, or main diagonal must always equal a constant—the “magic constant.– The array in figure I, then, is a magic square of 3rd order whose magic constant is the number 15.


Sign in / Sign up

Export Citation Format

Share Document