 17108 Sankhanil Dey and Ranjan Ghosh
 4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(p^q)
(589K, PDF)
Nov 24, 17

Abstract ,
Paper (src),
View paper
(auto. generated pdf),
Index
of related papers

Abstract. Substitution Box or SBox had been generated using 4bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The SBox of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(2^8) adding an additive constant in early twenty first century. In this paper Substitution Boxes have been generated from Irreducible or Reducible Polynomials over Galois field GF(p^q). Binary Galois fields have been used to generate Substitution Boxes. Since the Galois Field Number or the Number generated from coefficients of a polynomial over a particular Binary Galois field (2^q) is similar to log 2 q+1 bit BFs. So generation of log 2 q+1 bit SBoxes is Possible. Now if p = prime or nonprime number then generation of SBoxes is possible using Galois field GF (p^q). where, q = p1.
 Files:
17108.src(
17108.comments ,
17108.keywords ,
17.09.23 Paper to MP_arc.pdf.mm )