default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKishan Chand Gupta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta
:
On the construction of near-MDS matrices. Cryptogr. Commun. 16(2): 249-283 (2024)- [i11]Yogesh Kumar, Prasanna Raghaw Mishra, Susanta Samanta, Kishan Chand Gupta, Atul Gaur:
Construction of all MDS and involutory MDS matrices. CoRR abs/2403.10372 (2024) - 2023
- [i10]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta:
On the Construction of Near-MDS Matrices. CoRR abs/2306.12791 (2023) - [i9]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta:
On the Direct Construction of MDS and Near-MDS Matrices. CoRR abs/2306.12848 (2023) - 2022
- [c21]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta:
Construction of Recursive MDS Matrices Using DLS Matrices. AFRICACRYPT 2022: 3-27 - [c20]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta:
FUTURE: A Lightweight Block Cipher Using an Optimal Diffusion Matrix. AFRICACRYPT 2022: 28-52
2010 – 2019
- 2019
- [j18]Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray, Susanta Samanta:
Cryptographically significant mds matrices over finite fields: A brief survey and some generalized results. Adv. Math. Commun. 13(4): 779-843 (2019) - [j17]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Almost involutory recursive MDS diffusion layers. Des. Codes Cryptogr. 87(2-3): 609-626 (2019) - [c19]Kishan Chand Gupta, Sumit Kumar Pandey, Susanta Samanta:
A Few Negative Results on Constructions of MDS Matrices Using Low XOR Matrices. SPACE 2019: 195-213 - 2018
- [c18]Rana Barua, Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray:
On Diffusion Layers of SPN Based Format Preserving Encryption Schemes: Format Preserving Sets Revisited. INDOCRYPT 2018: 91-104 - 2017
- [j16]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
On the direct construction of recursive MDS matrices. Des. Codes Cryptogr. 82(1-2): 77-94 (2017) - [j15]Kishan Chand Gupta, Sumit Kumar Pandey, Ayineedi Venkateswarlu:
Towards a general construction of recursive MDS diffusion layers. Des. Codes Cryptogr. 82(1-2): 179-195 (2017) - [j14]Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray:
Applications of design theory for the constructions of MDS matrices for lightweight cryptography. J. Math. Cryptol. 11(2): 85 (2017) - 2016
- [c17]Donghoon Chang, Mohona Ghosh, Kishan Chand Gupta, Arpan Jati, Abhishek Kumar, Dukjae Moon, Indranil Ghosh Ray, Somitra Kumar Sanadhya:
SPF: A New Family of Efficient Format-Preserving Encryption Algorithms. Inscrypt 2016: 64-83 - [c16]Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray:
Format Preserving Sets: On Diffusion Layers of Format Preserving Encryption Schemes. INDOCRYPT 2016: 411-428 - 2015
- [j13]Kishan Chand Gupta, Indranil Ghosh Ray:
Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications. Cryptogr. Commun. 7(2): 257-287 (2015) - [j12]Kishan Chand Gupta, Indranil Ghosh Ray:
Finding Biaffine and Quadratic Equations for S-Boxes Based on Power Mappings. IEEE Trans. Inf. Theory 61(4): 2200-2209 (2015) - 2014
- [c15]Kishan Chand Gupta, Indranil Ghosh Ray:
On Constructions of Circulant MDS Matrices for Lightweight Cryptography. ISPEC 2014: 564-576 - 2013
- [c14]Kishan Chand Gupta, Indranil Ghosh Ray:
On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography. CD-ARES Workshops 2013: 29-43 - [c13]Kishan Chand Gupta, Indranil Ghosh Ray:
On Constructions of Involutory MDS Matrices. AFRICACRYPT 2013: 43-60 - [p1]Guang Gong, Kishan Chand Gupta:
Stream and block ciphers. Handbook of Finite Fields 2013: 750-763 - [i8]Kishan Chand Gupta, Indranil Ghosh Ray:
On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography. IACR Cryptol. ePrint Arch. 2013: 56 (2013) - 2012
- [r1]Rana Barua, Kishan Chand Gupta:
Finite Automata. Handbook of Finite State Based Models and Applications 2012: 1-17 - 2011
- [j11]Kishan Chand Gupta, Yassir Nawaz, Guang Gong:
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions. Inf. Process. Lett. 111(5): 247-249 (2011) - 2010
- [e1]Guang Gong, Kishan Chand Gupta:
Progress in Cryptology - INDOCRYPT 2010 - 11th International Conference on Cryptology in India, Hyderabad, India, December 12-15, 2010. Proceedings. Lecture Notes in Computer Science 6498, Springer 2010, ISBN 978-3-642-17400-1 [contents]
2000 – 2009
- 2009
- [j10]Kishan Chand Gupta, Palash Sarkar:
Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function. IEEE Trans. Inf. Theory 55(3): 1354-1359 (2009) - [j9]Yassir Nawaz, Kishan Chand Gupta, Guang Gong:
Algebraic immunity of S-boxes based on power mappings: analysis and construction. IEEE Trans. Inf. Theory 55(9): 4263-4273 (2009) - 2008
- [j8]Pradeep Kumar Mishra, Kishan Chand Gupta:
A metric on the set of elliptic curves over Fp. Appl. Math. Lett. 21(12): 1330-1332 (2008) - 2006
- [j7]Claude Carlet, Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra:
Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. IEEE Trans. Inf. Theory 52(7): 3105-3121 (2006) - [c12]Kishan Chand Gupta, Pradeep Kumar Mishra, Pinakpani Pal:
A General Methodology for Pipelining the Point Multiplication Operation in Curve Based Cryptography. ACNS 2006: 405-420 - [c11]Yassir Nawaz, Guang Gong, Kishan Chand Gupta:
Upper Bounds on Algebraic Immunity of Boolean Power Functions. FSE 2006: 375-389 - [c10]Donghoon Chang, Kishan Chand Gupta, Mridul Nandi:
RC4-Hash: A New Hash Function Based on RC4. INDOCRYPT 2006: 80-94 - [i7]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) - [i6]Yassir Nawaz, Kishan Chand Gupta, Guang Gong:
Algebraic Immunity of S-boxes Based on Power Mappings: Analysis and Construction. IACR Cryptol. ePrint Arch. 2006: 322 (2006) - 2005
- [j6]Kishan Chand Gupta, Palash Sarkar:
Construction of high degree resilient S-boxes with improved nonlinearity. Inf. Process. Lett. 95(3): 413-417 (2005) - [j5]Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu:
Results on multiples of primitive polynomials and their products over GF(2). Theor. Comput. Sci. 341(1-3): 311-343 (2005) - [j4]Kishan Chand Gupta, Palash Sarkar:
Improved construction of nonlinear resilient S-boxes. IEEE Trans. Inf. Theory 51(1): 339-348 (2005) - [j3]Kishan Chand Gupta, Palash Sarkar:
Toward a General Correlation Theorem. IEEE Trans. Inf. Theory 51(9): 3297-3302 (2005) - [c9]Guang Gong, Kishan Chand Gupta, Martin Hell, Yassir Nawaz:
Towards a General RC4-Like Keystream Generator. CISC 2005: 162-174 - [c8]Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra:
Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. FSE 2005: 98-111 - [i5]Pradeep Kumar Mishra, Kishan Chand Gupta:
A Metric on the Set of Elliptic Curves over Fp. IACR Cryptol. ePrint Arch. 2005: 6 (2005) - [i4]Yassir Nawaz, Kishan Chand Gupta, Guang Gong:
A 32-bit RC4-like Keystream Generator. IACR Cryptol. ePrint Arch. 2005: 175 (2005) - 2004
- [j2]Kishan Chand Gupta, Palash Sarkar:
Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. IEEE Trans. Inf. Theory 50(11): 2886-2893 (2004) - [c7]Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra:
Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. INDOCRYPT 2004: 92-106 - [c6]Kishan Chand Gupta, Palash Sarkar:
Efficient Representation and Software Implementation of Resilient Maiorana-McFarland S-boxes. WISA 2004: 317-331 - 2003
- [j1]Kishan Chand Gupta, Palash Sarkar:
Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function. Electron. Notes Discret. Math. 15: 92-96 (2003) - [c5]Kishan Chand Gupta, Palash Sarkar:
Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract). INDOCRYPT 2003: 107-120 - [i3]Kishan Chand Gupta, Palash Sarkar:
Computing Partial Walsh Transform from the Algebraic Normal Form of a Boolean Function. IACR Cryptol. ePrint Arch. 2003: 40 (2003) - [i2]Kishan Chand Gupta, Palash Sarkar:
A General Correlation Theorem. IACR Cryptol. ePrint Arch. 2003: 124 (2003) - [i1]Kishan Chand Gupta, Palash Sarkar:
Construction of Perfect Nonlinear and Maximally Nonlinear Multi-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. IACR Cryptol. ePrint Arch. 2003: 198 (2003) - 2002
- [c4]Kishan Chand Gupta, Palash Sarkar:
Improved Construction of Nonlinear Resilient S-Boxes. ASIACRYPT 2002: 466-483 - [c3]Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu:
Multiples of Primitive Polynomials and Their Products over GF(2). Selected Areas in Cryptography 2002: 214-231 - 2001
- [c2]Kishan Chand Gupta, Subhamoy Maitra:
Primitive Polynomials over GF(2) - A Cryptologic Approach. ICICS 2001: 23-34 - [c1]Kishan Chand Gupta, Subhamoy Maitra:
Multiples of Primitive Polynomials over GF(2). INDOCRYPT 2001: 62-72
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-10-28 20:12 CET 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:
