Sankhanil Dey

Publication Activity (10 Years)

Years Active: 2015-2020
Publications (10 Years): 22

Top Topics

Design Methodology

Encryption Algorithm

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
4-bit Boolean functions in generation and cryptanalysis of secure 4-bit crypto S-boxes. IACR Cryptol. ePrint Arch. 2020 (2020)
Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
A New Algorithm to Find Monic Irreducible Polynomials over Extended Galois field GF prime p and extension q using Positional Arithmetic. IACR Cryptol. ePrint Arch. 2020 (2020)
Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
Composite Algorithm The New Algorithm to Search for Monic Irreducible Polynomials over Extended Galois Fields. IACR Cryptol. ePrint Arch. 2020 (2020)
Sankhanil Dey, Ranjan Ghosh
Bent Boolean functions A better procedure to generate non-crypto 4-bit S-boxes. IACR Cryptol. ePrint Arch. 2020 (2020)
Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
4-bit Boolean functions in generation and cryptanalysis of secure 4-bit crypto S-boxes. Secur. Priv. 3 (1) (2020)
Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
A new algorithm to find monic irreducible polynomials over extended Galois field GF(pq) using positional arithmetic. Secur. Priv. 3 (5) (2020)
Sankhanil Dey, Amlan Chakrabarti, Ranjan Ghosh
Division Algorithm to search for monic irreducible polynomials over extended Galois Field GF(p^q). IACR Cryptol. ePrint Arch. 2020 (2020)
Sankhanil Dey, Ranjan Ghosh
A review of cryptographic properties of S-boxes with generation and analysis of crypto secure S-boxes. PeerJ Prepr. 6 (2018)
Sankhanil Dey, Ranjan Ghosh
4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis. IACR Cryptol. ePrint Arch. 2018 (2018)
Sankhanil Dey, Ranjan Ghosh
A review of cryptographic properties of S-boxes with Generation and Analysis of crypto secure S-boxes. IACR Cryptol. ePrint Arch. 2018 (2018)
Sankhanil Dey, Ranjan Ghosh
). IACR Cryptol. ePrint Arch. 2017 (2017)
Sankhanil Dey, Ranjan Ghosh
4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(p^q) for Smart Applications. CoRR (2017)
Sankhanil Dey, Ranjan Ghosh
). PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
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. PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
Crypto-Archaeology: unearthing design methodology of DES s-boxes. PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
A New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q). CoRR (2017)
Sankhanil Dey, Ranjan Ghosh
Linear Approximation Analysis: an improved technique for linear cryptanalysis of 4-bit Bijective Crypto S-Boxes. PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
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. IACR Cryptol. ePrint Arch. 2017 (2017)
Sankhanil Dey, Ranjan Ghosh
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. PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
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). PeerJ Prepr. 5 (2017)
Sankhanil Dey, Ranjan Ghosh
Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q). PeerJ Prepr. 5 (2017)
J. K. M. Sadique Uz Zaman, Sankhanil Dey, Ranjan Ghosh
). ACSS (1) (2015)