#### Filter Results:

#### Publication Year

2011

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
- Des. Codes Cryptography
- 2011

Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This conjecture is about the number of primitive σ-LFSRs of a given order over a finite field, and it generalizes a known formula… (More)

- Sartaj Ul Hasan, Daniel Panario, Qiang Wang
- SETA
- 2012

- Stephen D. Cohen, Sartaj Ul Hasan, Daniel Panario, Qiang Wang
- ArXiv
- 2015

We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short proof for the exact number of irreducible transformation shift registers of order two using a recent generalization of a… (More)

- Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan
- Discrete Applied Mathematics
- 2017

The multiple-recursive matrix method for generating pseudoran-dom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive… (More)

- Peter Beelen, Sudhir R. Ghorpade, Sartaj Ul Hasan
- Discrete Mathematics
- 2015

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The case of varieties defined by the vanishing of 2 × 2 minors is considered in some detail. Here we obtain the complete… (More)

This thesis consists of two parts. The first part deals with problems arising in cryptography, while the second part is related to the theory of linear error correcting codes. PART-1: In this part, we consider a recent generalization of recursive sequences generated by LFSRs, i.e., linear feedback shift registers, over finite fields. More specifically, we… (More)

- ‹
- 1
- ›