default search action
Deepak Kumar Dalai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Deepak Kumar Dalai, Krishna Mallick:
A class of weightwise almost perfectly balanced Boolean functions. Adv. Math. Commun. 18(2): 480-504 (2024) - [j10]Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager:
On linear complementary pairs of algebraic geometry codes over finite fields. Discret. Math. 347(12): 114193 (2024) - [i9]Sanjit Bhowmick, Deepak Kumar Dalai:
Additive Complementary Pairs of Codes. CoRR abs/2404.13249 (2024) - [i8]Deepak Kumar Dalai, Krishna Mallick:
A Class of Weightwise Almost Perfectly Balanced Boolean Functions with High Weightwise Nonlinearity. IACR Cryptol. ePrint Arch. 2024: 422 (2024) - 2023
- [i7]Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager:
On Linear Complementary Pairs of Algebraic Geometry Codes over Finite Fields. CoRR abs/2311.01008 (2023) - 2022
- [j9]Deepak Kumar Dalai, Santu Pal
, Santanu Sarkar
A state bit recovery algorithm with TMDTO attack on Lizard and Grain-128a. Des. Codes Cryptogr. 90(3): 489-521 (2022) - [j8]Deepak Kumar Dalai
Some Conditional Cube Testers for Grain-128a of Reduced Rounds. IEEE Trans. Computers 71(6): 1374-1385 (2022) - 2021
- [j7]Dibyendu Roy, Deepak Kumar Dalai
An Observation of Non-randomness in NFSR-Based Stream Ciphers with Reduced Initialization Round. J. Hardw. Syst. Secur. 5(2): 89-102 (2021) - 2020
- [j6]Deepak Kumar Dalai
Bidirectional hash chains generically enhances resilience of key predistribution schemes. IET Wirel. Sens. Syst. 10(4): 154-165 (2020)
2010 – 2019
- 2019
- [j5]Deepak Kumar Dalai
Distinguisher and non-randomness of Grain-v1 for 112, 114 and 116 initialisation rounds with multiple-bit difference in IVs. IET Inf. Secur. 13(6): 603-613 (2019) - [c14]Deepak Kumar Dalai
A Basic Theory of Lightweight Hierarchical Key Predistribution Scheme. CyberICPS/SECPRE/SPOSE/ADIoT@ESORICS 2019: 325-340 - [c13]Deepak Kumar Dalai
Wip: Degree Evaluation of Grain-v1. ICISS 2019: 239-251 - [c12]Deepak Kumar Dalai
Recovering Internal States of Grain-v1. ISPEC 2019: 325-337 - 2018
- [c11]Deepak Kumar Dalai
An Observation of Non-randomness in the Grain Family of Stream Ciphers with Reduced Initialization Round. SPACE 2018: 1-20 - 2017
- [c10]Deepak Kumar Dalai
A State Recovery Attack on ACORN-v1 and ACORN-v2. NSS 2017: 332-345 - [c9]Deepak Kumar Dalai
Enhancing Resilience of KPS Using Bidirectional Hash Chains and Application on Sensornet. NSS 2017: 683-693 - [c8]Deepak Kumar Dalai
Sensornet - A Key Predistribution Scheme for Distributed Sensors using Nets. SENSORNETS 2017: 49-58 - 2016
- [c7]Deepak Kumar Dalai
Key Predistribution Schemes Using Bent Functions in Distributed Sensor Networks. Inscrypt 2016: 367-385 - 2015
- [c6]Deepak Kumar Dalai
On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions. CAI 2015: 79-89 - 2013
- [i6]Deepak Kumar Dalai:
Computing the Rank of Incidence Matrix and Algebraic Immunity of Boolean Functions. IACR Cryptol. ePrint Arch. 2013: 273 (2013)
2000 – 2009
- 2009
- [j4]Deepak Kumar Dalai
Algebraic Immunity of Boolean Functions Analysis and Construction. Computación y Sistemas 12(3) (2009) - [j3]Deepak Kumar Dalai
Results on rotation symmetric bent functions. Discret. Math. 309(8): 2398-2409 (2009) - 2008
- [c5]Deepak Kumar Dalai
On 3-to-1 and Power APN S-Boxes. SETA 2008: 377-389 - 2006
- [j2]Deepak Kumar Dalai
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. Des. Codes Cryptogr. 40(1): 41-58 (2006) - [j1]Claude Carlet, Deepak Kumar Dalai
Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. IEEE Trans. Inf. Theory 52(7): 3105-3121 (2006) - [c4]Claude Carlet, Deepak Kumar Dalai
Cryptographic Properties and Structure of Boolean Functions with Full Algebraic Immunity. ISIT 2006: 734-738 - [c3]Deepak Kumar Dalai
Reducing the Number of Homogeneous Linear Equations in Finding Annihilators. SETA 2006: 376-390 - [i5]Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra:
Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks. IACR Cryptol. ePrint Arch. 2006: 18 (2006) - [i4]Deepak Kumar Dalai, Subhamoy Maitra:
Reducing the Number of Homogeneous Linear Equations in Finding Annihilators. IACR Cryptol. ePrint Arch. 2006: 32 (2006) - [i3]Deepak Kumar Dalai, Subhamoy Maitra:
Balanced Boolean Functions with (more than) Maximum Algebraic Immunity. IACR Cryptol. ePrint Arch. 2006: 434 (2006) - 2005
- [c2]Deepak Kumar Dalai
Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. FSE 2005: 98-111 - [i2]Deepak Kumar Dalai, Subhamoy Maitra:
Results on Rotation Symmetric Bent Functions. IACR Cryptol. ePrint Arch. 2005: 118 (2005) - [i1]Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarkar:
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. IACR Cryptol. ePrint Arch. 2005: 229 (2005) - 2004
- [c1]Deepak Kumar Dalai
Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. INDOCRYPT 2004: 92-106
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-08-14 22:19 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: