dblp.uni-trier.dewww.uni-trier.de

Kishan Chand Gupta

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
21EEKishan Chand Gupta, Palash Sarkar: Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function. IEEE Transactions on Information Theory 55(3): 1354-1359 (2009)
2008
20EEPradeep Kumar Mishra, Kishan Chand Gupta: A metric on the set of elliptic curves over Fp. Appl. Math. Lett. 21(12): 1330-1332 (2008)
2006
19EEKishan Chand Gupta, Pradeep Kumar Mishra, Pinakpani Pal: A General Methodology for Pipelining the Point Multiplication Operation in Curve Based Cryptography. ACNS 2006: 405-420
18EEYassir Nawaz, Guang Gong, Kishan Chand Gupta: Upper Bounds on Algebraic Immunity of Boolean Power Functions. FSE 2006: 375-389
17EEDonghoon Chang, Kishan Chand Gupta, Mridul Nandi: RC4-Hash: A New Hash Function Based on RC4. INDOCRYPT 2006: 80-94
16EEClaude Carlet, Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra: Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. IEEE Transactions on Information Theory 52(7): 3105-3121 (2006)
2005
15EEGuang Gong, Kishan Chand Gupta, Martin Hell, Yassir Nawaz: Towards a General RC4-Like Keystream Generator. CISC 2005: 162-174
14EEDeepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra: Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. FSE 2005: 98-111
13EEKishan Chand Gupta, Palash Sarkar: Improved construction of nonlinear resilient S-boxes. IEEE Transactions on Information Theory 51(1): 339-348 (2005)
12EEKishan Chand Gupta, Palash Sarkar: Toward a General Correlation Theorem. IEEE Transactions on Information Theory 51(9): 3297-3302 (2005)
11EEKishan Chand Gupta, Palash Sarkar: Construction of high degree resilient S-boxes with improved nonlinearity. Inf. Process. Lett. 95(3): 413-417 (2005)
10EESubhamoy 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)
2004
9EEDeepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra: Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. INDOCRYPT 2004: 92-106
8EEKishan Chand Gupta, Palash Sarkar: Efficient Representation and Software Implementation of Resilient Maiorana-McFarland S-boxes. WISA 2004: 317-331
7 Kishan Chand Gupta, Palash Sarkar: Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. IEEE Transactions on Information Theory 50(11): 2886-2893 (2004)
2003
6EEKishan 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
5EEKishan Chand Gupta, Palash Sarkar: Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function. Electronic Notes in Discrete Mathematics 15: 92-96 (2003)
2002
4EEKishan Chand Gupta, Palash Sarkar: Improved Construction of Nonlinear Resilient S-Boxes. ASIACRYPT 2002: 466-483
3EESubhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu: Multiples of Primitive Polynomials and Their Products over GF(2). Selected Areas in Cryptography 2002: 214-231
2001
2EEKishan Chand Gupta, Subhamoy Maitra: Primitive Polynomials over GF(2) - A Cryptologic Approach. ICICS 2001: 23-34
1EEKishan Chand Gupta, Subhamoy Maitra: Multiples of Primitive Polynomials over GF(2). INDOCRYPT 2001: 62-72

Coauthor Index

1Claude Carlet [16]
2Donghoon Chang [17]
3Deepak Kumar Dalai [9] [14] [16]
4Guang Gong [15] [18]
5Martin Hell [15]
6Subhamoy Maitra [1] [2] [3] [9] [10] [14] [16]
7Pradeep Kumar Mishra [19] [20]
8Mridul Nandi [17]
9Yassir Nawaz [15] [18]
10Pinakpani Pal [19]
11Palash Sarkar [4] [5] [6] [7] [8] [11] [12] [13] [21]
12Ayineedi Venkateswarlu [3] [10]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)