default search action
Sankhanil Dey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j2]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) - [j1]Sankhanil Dey
A new algorithm to find monic irreducible polynomials over extended Galois field GF(pq) using positional arithmetic. Secur. Priv. 3(5) (2020) - [i19]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: 358 (2020) - [i18]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: 359 (2020) - [i17]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: 360 (2020) - [i16]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: 365 (2020) - [i15]Sankhanil Dey, Ranjan Ghosh:
Bent Boolean functions A better procedure to generate non-crypto 4-bit S-boxes. IACR Cryptol. ePrint Arch. 2020: 878 (2020)
2010 – 2019
- 2018
- [i14]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: 405 (2018) - [i13]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: 591 (2018) - [i12]Sankhanil Dey, Ranjan Ghosh:
A review of cryptographic properties of S-boxes with generation and analysis of crypto secure S-boxes. PeerJ Prepr. 6: e26452 (2018) - 2017
- [i11]Sankhanil Dey, Ranjan Ghosh:
A New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q). CoRR abs/1711.06893 (2017) - [i10]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 abs/1711.09166 (2017) - [i9]Sankhanil Dey, Ranjan Ghosh:
Multiplication and Division over Extended Galois Field GF(pq): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF(pq). IACR Cryptol. ePrint Arch. 2017: 556 (2017) - [i8]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: 1161 (2017) - [i7]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: e3202 (2017) - [i6]Sankhanil Dey, Ranjan Ghosh:
Linear Approximation Analysis: an improved technique for linear cryptanalysis of 4-bit Bijective Crypto S-Boxes. PeerJ Prepr. 5: e3249 (2017) - [i5]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: e3258 (2017) - [i4]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: e3259 (2017) - [i3]Sankhanil Dey, Ranjan Ghosh:
Crypto-Archaeology: unearthing design methodology of DES s-boxes. PeerJ Prepr. 5: e3285 (2017) - [i2]Sankhanil Dey, Ranjan Ghosh:
4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(pq). PeerJ Prepr. 5: e3300 (2017) - [i1]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: e3441 (2017) - 2015
- [c1]J. K. M. Sadique Uz Zaman, Sankhanil Dey
Dynamic Ciphering-15 Based on Multiplicative Polynomial Inverses Over Galois Field GF(73). ACSS (1) 2015: 31-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: