default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBimal Mandal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Vikas Kumar
, Bimal Mandal, Aditi Kar Gangopadhyay:
On the Gowers U2 and U3 norms of Boolean functions and their restriction to hyperplanes. Discret. Appl. Math. 341: 4-8 (2023)- [c6]Vikas Kumar, Bimal Mandal, Aditi Kar Gangopadhyay, Sugata Gangopadhyay:
Computational Results on Gowers U2 and U3 Norms of Known S-Boxes. C2SI 2023: 150-157 - [i5]Aditi Kar Gangopadhyay, Mansi, Bimal Mandal, Aleksandr Kutsenko, Sugata Gangopadhyay:
Rayleigh quotients of Dillon's functions. CoRR abs/2304.03884 (2023) - [i4]Anupam Chattopadhyay, Subhamoy Maitra, Bimal Mandal, Manmatha Roy, Deng Tang:
Efficient Hardware Implementation for Maiorana-McFarland type Functions. IACR Cryptol. ePrint Arch. 2023: 1970 (2023) - 2022
- [j15]Bimal Mandal, Subhamoy Maitra, Pantelimon Stanica:
On the existence and non-existence of some classes of bent-negabent functions. Appl. Algebra Eng. Commun. Comput. 33(3): 237-260 (2022) - [j14]Sihem Mesnager, Bimal Mandal, Mounira Msahli:
Survey on recent trends towards generalized differential and boomerang uniformities. Cryptogr. Commun. 14(4): 691-735 (2022) - [j13]Deng Tang, Bimal Mandal, Subhamoy Maitra:
Further cryptographic properties of the multiplicative inverse function. Discret. Appl. Math. 307: 191-211 (2022) - [c5]Subhamoy Maitra, Bimal Mandal, Manmatha Roy:
Modifying Bent Functions to Obtain the Balanced Ones with High Nonlinearity. INDOCRYPT 2022: 449-470 - 2021
- [j12]Bimal Mandal, Aditi Kar Gangopadhyay:
A note on generalization of bent boolean functions. Adv. Math. Commun. 15(2): 329-346 (2021) - [j11]Deng Tang, Bimal Mandal, Subhamoy Maitra:
Construction of balanced vectorial Boolean functions with almost optimal nonlinearity and very low differential-linear uniformity. Finite Fields Their Appl. 76: 101903 (2021) - 2020
- [j10]Sihem Mesnager, Bimal Mandal, Chunming Tang:
New characterizations and construction methods of bent and hyper-bent Boolean functions. Discret. Math. 343(11): 112081 (2020) - [j9]Subhamoy Maitra, Bimal Mandal, Thor Martinsen, Dibyendu Roy, Pantelimon Stanica:
Analysis on Boolean Function in a Restricted (Biased) Domain. IEEE Trans. Inf. Theory 66(2): 1219-1231 (2020) - [j8]Hamid Boukerrou, Paul Huynh, Virginie Lallemand, Bimal Mandal, Marine Minier:
On the Feistel Counterpart of the Boomerang Connectivity Table Introduction and Analysis of the FBCT. IACR Trans. Symmetric Cryptol. 2020(1): 331-362 (2020) - [c4]Subhamoy Maitra, Bimal Mandal, Manmatha Roy, Deng Tang:
Experimental Results on Higher-Order Differential Spectra of 6 and 8-bit Invertible S-Boxes. SPACE 2020: 226-237 - [i3]Deng Tang, Bimal Mandal, Subhamoy Maitra:
Further Cryptographic Properties of the Multiplicative Inverse Function. IACR Cryptol. ePrint Arch. 2020: 920 (2020)
2010 – 2019
- 2019
- [j7]Pantelimon Stanica, Bimal Mandal, Subhamoy Maitra:
The connection between quadratic bent-negabent functions and the Kerdock code. Appl. Algebra Eng. Commun. Comput. 30(5): 387-401 (2019) - [j6]Bimal Mandal, Pantelimon Stanica, Sugata Gangopadhyay:
New classes of p-ary bent functions. Cryptogr. Commun. 11(1): 77-92 (2019) - [j5]Deng Tang, Selçuk Kavut, Bimal Mandal, Subhamoy Maitra:
Modifying Maiorana-McFarland Type Bent Functions for Good Cryptographic Properties and Efficient Implementation. SIAM J. Discret. Math. 33(1): 238-256 (2019) - [c3]Deng Tang, Bimal Mandal, Subhamoy Maitra:
Vectorial Boolean Functions with Very Low Differential-Linear Uniformity Using Maiorana-McFarland Type Construction. INDOCRYPT 2019: 341-360 - 2018
- [j4]Bimal Mandal, Bhupendra Singh, Sugata Gangopadhyay, Subhamoy Maitra, Vellaichamy Vetrivel:
On non-existence of bent-negabent rotation symmetric Boolean functions. Discret. Appl. Math. 236: 1-6 (2018) - [j3]Sugata Gangopadhyay, Bimal Mandal, Pantelimon Stanica:
Gowers U3 norm of some classes of bent Boolean functions. Des. Codes Cryptogr. 86(5): 1131-1148 (2018) - [c2]Subhamoy Maitra, Bimal Mandal, Thor Martinsen, Dibyendu Roy, Pantelimon Stanica:
Tools in Analyzing Linear Approximation for Boolean Functions Related to FLIP. INDOCRYPT 2018: 282-303 - [c1]Mustafa Khairallah, Anupam Chattopadhyay, Bimal Mandal, Subhamoy Maitra:
On Hardware Implementation of Tang-Maitra Boolean Functions. WAIFI 2018: 111-127 - [i2]Mustafa Khairallah, Anupam Chattopadhyay, Bimal Mandal, Subhamoy Maitra:
On Hardware Implementation of Tang-Maitra Boolean Functions. IACR Cryptol. ePrint Arch. 2018: 667 (2018) - 2017
- [j2]Bimal Mandal, Sugata Gangopadhyay, Pantelimon Stanica:
Cubic Maiorana-McFarland bent functions with no affine derivative. Int. J. Comput. Math. Comput. Syst. Theory 2(1): 14-27 (2017) - 2016
- [j1]Bimal Mandal, Pantelimon Stanica, Sugata Gangopadhyay, Enes Pasalic:
An Analysis of the 풞 Class of Bent Functions. Fundam. Informaticae 146(3): 271-292 (2016) - 2015
- [i1]Bimal Mandal, Pantelimon Stanica, Sugata Gangopadhyay, Enes Pasalic:
An analysis of the C class of bent functions. IACR Cryptol. ePrint Arch. 2015: 588 (2015)
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-24 22:46 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:
