Dynamic Ciphering-15 Based on Multiplicative Polynomial Inverses Over Galois Field GF(73). - J. K. M. Sadique Uz Zaman; Sankhanil Dey; Ranjan Ghosh (ACSS (1), 2015)

A New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q). - Sankhanil Dey; Ranjan Ghosh (CoRR, 2017)

4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(p^q) for Smart Applications. - Sankhanil Dey; Ranjan Ghosh (CoRR, 2017)

Multiplication and Division over Extended Galois Field GF(pq): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF(pq). - Sankhanil Dey; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2017)

Extended SAC: A review and new algorithms of differential cryptanalysis of 4-bit s-boxes and strict avalanche criterion of BFs and 4-bit s-boxes again with a new extension to HO-SAC criterion. - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

Linear Approximation Analysis: an improved technique for linear cryptanalysis of 4-bit Bijective Crypto S-Boxes. - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q). - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

Multiplication and Division over Extended Galois Field GF(p^q): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF(p^q). - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

Crypto-Archaeology: unearthing design methodology of DES s-boxes. - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(pq). - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

A review of existing 4-bit crypto S-box cryptanalysis techniques and two new techniques with 4-bit Boolean functions for cryptanalysis of 4-bit crypto S-boxes. - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2017)

4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis. - Sankhanil Dey; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2018)

A review of cryptographic properties of S-boxes with generation and analysis of crypto secure S-boxes. - Sankhanil Dey; Ranjan Ghosh (PeerJ Prepr., 2018)

Division Algorithm to search for monic irreducible polynomials over extended Galois Field GF(p^q). - Sankhanil Dey; Amlan Chakrabarti; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2020)

Composite Algorithm The New Algorithm to Search for Monic Irreducible Polynomials over Extended Galois Fields. - Sankhanil Dey; Amlan Chakrabarti; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2020)

A New Algorithm to Find Monic Irreducible Polynomials over Extended Galois field GF prime p and extension q using Positional Arithmetic. - Sankhanil Dey; Amlan Chakrabarti; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2020)

Bent Boolean functions A better procedure to generate non-crypto 4-bit S-boxes. - Sankhanil Dey; Ranjan Ghosh (IACR Cryptol. ePrint Arch., 2020)

4-bit Boolean functions in generation and cryptanalysis of secure 4-bit crypto S-boxes. - Sankhanil Dey; Amlan Chakrabarti; Ranjan Ghosh (Secur. Priv., 2020)

A new algorithm to find monic irreducible polynomials over extended Galois field GF(pq) using positional arithmetic. - Sankhanil Dey; Amlan Chakrabarti; Ranjan Ghosh (Secur. Priv., 2020)