Publications

Books

  1. (B. Zolfaghari, K. Bibak) Perfect Secrecy in IoT: A Hybrid Combinatorial-Boolean Approach, Springer, 2022, 128 pages.
  2. (B. Zolfaghari, K. Bibak, T. Koshiba, H. Nemati, P. Mitra) Statistical Trend Analysis of Physically Unclonable Functions: An Approach via Text MiningCRC Press, 2021, 160 pages.
  3. (K. Bibak) Restricted Congruences in ComputingCRC Press, 2020, 157 pages.

Book Chapters

  1. (K. Bibak) Additive combinatorics with a view towards computer science and cryptography, Number Theory and Related Fields: In Memory of Alf van der Poorten (J. M. Borwein, I. E. Shparlinski and W. Zudilin, eds.), Springer Proceedings in Mathematics & Statistics, Vol. 43, Springer, New York, 2013, pp. 99-128; [arXiv], [chapter]. (The most downloaded Chapter of the Book.)

Journal Papers

  1. (B. Zolfaghari, L. Mirsadeghi, K. Bibak, K. Kavousi) Cancer prognosis and diagnosis methods based on ensemble learning, ACM Computing Surveys, to appear; [journal].
  2. (T. Koshiba, B. Zolfaghari, K. Bibak) A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm, Journal of Information Security and Applications 73 (2023), 103430; [journal].
  3. (K. Bibak, B. Zolfaghari) The Modular Subset-Sum Problem and the size of deletion correcting codes, Designs, Codes and Cryptography 90 (2022), 1721-1734; [journal].
  4. (K. Bibak) Quantum key distribution using universal hash functions over finite fields, Quantum Information Processing 21 (2022), 121; [journal].
  5. (B. Zolfaghari, K. Bibak, T. Koshiba) From random numbers to random objects, Entropy 24 (2022), 928; [journal].
  6. (B. Zolfaghari, K. Bibak, T. Koshiba) The odyssey of entropy: cryptography, Entropy 24 (2022), 266; [journal].
  7. (K. Bibak, B. Kapron, V. Srinivasan) Authentication of variable length messages in quantum key distribution, EPJ Quantum Technology 9 (2022), 8; [journal].
  8. (R. Ritchie, K. Bibak) DOTMIX-Pro: Faster and more efficient variants of DOTMIX for dynamic-multithreading platforms, The Journal of Supercomputing 78 (2022), 945-961; [journal].
  9. (K. Bibak, R. Ritchie, B. Zolfaghari) Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash, Quantum Information & Computation 21 (2021), 181-202; [journal].
  10. (K. Bibak, R. Ritchie) Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security, Quantum Information Processing 20 (2021), 228; [journal].
  11. (B. Zolfaghari, V. Singh, B. Rai, K. Bibak, T. Koshiba) Cryptography in hierarchical coded caching: system model and cost analysis, Entropy 23 (2021), 1459; [journal].
  12. (B. Zolfaghari, V. Singh, S. Reddy, B. Rai, K. Bibak, A. Dehghantanha) Lower bounds on bandwidth requirements of regenerating code parameter scaling in distributed storage systems, IEEE Communications Letters 25 (2021), 1477-1481; [journal].
  13. (K. Bibak) Deletion correcting codes meet the Littlewood-Offord problem, Designs, Codes and Cryptography 88 (2020), 2387-2396; [journal].
  14. (B. Zolfaghari, G. Srivastava, S. Roy, H. Nemati, F. Afghah, T. Koshiba, A. Razi, K. Bibak, P. Mitra, B. Rai) Content delivery networks: state of the art, trends and future roadmap, ACM Computing Surveys 53 (2020), 34:1-34:34; [journal].
  15. (V. Singh, B. Zolfaghari, C. Kumar, B. Rai, K. Bibak, G. Srivastava, S. Roy, T. Koshiba) Generalized Mm,r-network: A case for fixed message dimensions, IEEE Communications Letters 24 (2020), 38-42; [journal].
  16. (K. Bibak) Order-restricted linear congruences, Discrete Mathematics 343 (2020), 111690; [journal]. Selected as Editors’ Choice
  17. (K. Bibak, O. Milenkovic) Explicit formulas for the weight enumerators of some classes of deletion correcting codes, IEEE Transactions on Communications 67 (2019), 1809-1816; [arXiv], [journal].
  18. (K. Bibak, B. KapronV. Srinivasan) A generalization of Schonemann’s theorem via a graph theoretic method, Discrete Mathematics 342 (2019), 3057-3061; [arXiv], [journal].
  19. (K. Bibak, B. KapronV. Srinivasan) Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes, Designs, Codes and Cryptography 86 (2018), 1893-1904; [journal].
  20. (K. Bibak, B. M. KapronV. SrinivasanL. Toth) On an almost-universal hash function family with applications to authentication and secrecy codes, International Journal of Foundations of Computer Science 29 (2018), 357-375; [arXiv], [IACR], [journal].
  21. (K. Bibak, B. KapronV. SrinivasanR. TaurasoL. Toth) Restricted linear congruences, Journal of Number Theory 171 (2017), 128-144; [arXiv], [IACR], [journal].
  22. (K. Bibak, B. KapronV. Srinivasan) Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT, Nuclear Physics B 910 (2016), 712-723; [arXiv], [journal].
  23. (K. Bibak, B. KapronV. Srinivasan) The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs, IEEE Transactions on Information Theory 62 (2016), 6355-6358; [journal].
  24. (K. Bibak, B. KapronV. Srinivasan) MMH* with arbitrary modulus is always almost-universal, Information Processing Letters 116 (2016), 481-483; [journal].
  25. (K. Bibak, B. KapronV. Srinivasan) On a restricted linear congruence, International Journal of Number Theory 12 (2016), 2167-2171; [arXiv], [journal].
  26. (P. Salehi Nowbandegani, H. EsfandiariM. H. Shirdareh Haghighi, K. Bibak) On the Erdős-Gyarfas conjecture in claw-free graphs, Discussiones Mathematicae Graph Theory 34 (2014), 635-640; [arXiv], [journal].
  27. (K. Bibak) The number of spanning trees in an (r,s)-semiregular graph and its line graph, International Journal of Quantum Chemistry 113 (2013), 1209-1212; [journal]. Featured on the cover of the Journal
  28. (K. Bibak, R. Tauraso) Determinants of grids, tori, cylinders and Mobius ladders, Discrete Mathematics 313 (2013), 1436-1440; [arXiv], [journal].
  29. (K. Bibak) On the determinant of bipartite graphs, Discrete Mathematics 313 (2013), 2446-2450; [journal].
  30. (M. H. Shirdareh Haghighi, K. Bibak) The number of spanning trees in some classes of graphs, Rocky Mountain Journal of Mathematics 42 (2012), 1183-1195; [journal].
  31. (K. Bibak, I. E. Shparlinski) On fully split lacunary polynomials in finite fields, Bulletin of the Polish Academy of Sciences, Mathematics 59 (2011), 197-202; [arXiv], [journal].
  32. (K. Bibak, M. H. Shirdareh Haghighi) Degree-equipartite graphs, Discrete Mathematics 311 (2011), 888-891; [arXiv], [journal].
  33. (K. Bibak, M. H. Shirdareh Haghighi) Some trigonometric identities involving Fibonacci and Lucas numbers, Journal of Integer Sequences 12 (2009), Article 09.8.4; [journal].
  34. (M. H. Shirdareh Haghighi, K. Bibak) Recursive relations for the number of spanning trees, Applied Mathematical Sciences 3 (2009), 2263-2269.

Conference Papers

  1. (R. Ritchie, K. Bibak) SQUAREMIX: A faster pseudorandom number generator for dynamic-multithreading platforms, In Proceedings of the 2020 Data Compression Conference (DCC 2020), Snowbird, Utah, USA, March 24-27, 2020; [conference].
  2. (K. Bibak, O. Milenkovic) Weight enumerators of some classes of deletion correcting codes, In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT 2018), Vail, Colorado, USA, Jun. 17-22, 2018, pp. 431-435; [conference].
  3. (K. Bibak, B. KapronV. SrinivasanL. Toth) On a variant of multilinear modular hashing with applications to authentication and secrecy codes, In Proceedings of the International Symposium on Information Theory and Its Applications (ISITA 2016), Monterey, California, USA, Oct. 30 — Nov. 2, 2016, pp. 320-324; [conference].
  4. (M. H. Shirdareh Haghighi, K. Bibak) Distribution of cycle lengths in graphs with minimum degree at least three, In Proceedings of the 39th Annual Iranian Mathematics Conference, Shahid Bahonar University of Kerman, Kerman, Iran, Aug. 24-27, 2008.

Problems

  1. (K. Bibak) Problem # 1884Mathematics Magazine, Vol. 84, No. 5, December 2011. [The published solution is here.]
  2. (K. Bibak) Problem # 11590American Mathematical Monthly, Vol. 118, No. 7, August-September 2011. [The published solution is here.]

Theses

  1. (K. Bibak) Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry, PhD thesis, Department of Computer Science, University of Victoria, 2017.
  2. (K. Bibak) Contributions at the interface between algebra and graph theory, Master’s thesis, Department of Combinatorics and Optimization, University of Waterloo, 2013.

Technical Reports

  1. (K. Bibak, C. Liu, H. Vosoughpour, G. Yao, Z. AlMeraj, A. Pytel, W. CowanS. MannImplicit surfaces seminar, Spring 2012, Technical Report CS-2013-08, David R. Cheriton School of Computer Science, University of Waterloo, 2013 (40 pages).