The following pages link to Srimanta Bhattacharya (Q444515):
Displaying 8 items.
- Combinatorial batch codes: a lower bound and optimal constructions (Q444518) (← links)
- On some permutation binomials and trinomials over \(\mathbb{F}_{2^n}\) (Q510461) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- A note on the chi-square method: a tool for proving cryptographic security (Q1749799) (← links)
- An ensemble of high rank matrices arising from tournaments (Q2104983) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- On Some Permutation Binomials of the Form $x^{\frac{2^n-1}{k}+1} +ax$ over $\mathbb{F}_{2^n}$ : Existence and Count (Q3166985) (← links)
