#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Khodakhast Bibak, Roberto Tauraso
- Discrete Mathematics
- 2013

- Khodakhast Bibak
- Discrete Mathematics
- 2013

The nullity of a graphG, denoted by η(G), is themultiplicity of 0 in the spectrumofG. Nullity of a (molecular) graph (e.g., a bipartite graph corresponding to an alternant hydrocarbon) has important… (More)

In this paper, using properties of Ramanujan sums and of the finite Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence a1x1 +… (More)

- Khodakhast Bibak
- Number Theory and Related Fields
- 2013

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define – perhaps because of a blend of ideas and techniques from… (More)

- Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, László Tóth
- IACR Cryptology ePrint Archive
- 2015

Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. The following family, called MMH∗ by Halevi and Krawczyk in 1997, is well known: Let p… (More)

- Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
- IEEE Transactions on Information Theory
- 2016

Let Z<sub>n</sub>[i] be the ring of Gaussian integers modulo a positive integer n. Very recently, Camarero and Martinez et al. showed that for every prime number p > 5 such that p ≡… (More)

- Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth
- IACR Cryptology ePrint Archive
- 2015

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence a1x1… (More)

- Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
- Inf. Process. Lett.
- 2016

- Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth
- 2016 International Symposium on Information…
- 2016

Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. As a well known family, one can mention MMH∗ which was shown to be… (More)

- Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
- ArXiv
- 2017

Recently, Grynkiewicz et al. [Israel J. Math. 193 (2013), 359–398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear… (More)