Khodakhast Bibak

Mostafa Abbas Mollaei

Fahimeh Hajizadeh

Naoto Yanai

ACM Comput. Surv., November, 2024

2023

Cancer Prognosis and Diagnosis Methods Based on Ensemble Learning.

[BibT_eX]

[DOI]

ACM Comput. Surv., December, 2023

A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm.

[BibT_eX]

[DOI]

Takeshi Koshiba

J. Inf. Secur. Appl., March, 2023

2022

DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms.

[BibT_eX]

[DOI]

J. Supercomput., 2022

Quantum key distribution using universal hash functions over finite fields.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2022

From Random Numbers to Random Objects.

[BibT_eX]

[DOI]

Takeshi Koshiba

Entropy, 2022

The Odyssey of Entropy: Cryptography.

[BibT_eX]

[DOI]

Takeshi Koshiba

Entropy, 2022

The Modular Subset-Sum Problem and the size of deletion correcting codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

Perfect Secrecy in IoT - A Hybrid Combinatorial-Boolean Approach

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-031-13190-5, 2022

2021

Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2021

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2021

Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2021

Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis.

[BibT_eX]

[DOI]

Entropy, 2021

Content Delivery Networks: State of the Art, Trends, and Future Roadmap.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2021

2020

Generalized M<sub>m, r</sub>-Network: A Case for Fixed Message Dimensions.

[BibT_eX]

[DOI]

Vikrant Singh

Chunduri Venkata Dheeraj Kumar

IEEE Commun. Lett., 2020

Order-restricted linear congruences.

[BibT_eX]

[DOI]

Discret. Math., 2020

Deletion correcting codes meet the Littlewood-Offord problem.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

MMH* with arbitrary modulus is always almost-universal.

[BibT_eX]

[DOI]

CoRR, 2020

SQUAREMIX: A Faster Pseudorandom Number Generator for Dynamic-Multithreading Platforms.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

2019

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes.

[BibT_eX]

[DOI]

Olgica Milenkovic

IEEE Trans. Commun., 2019

A generalization of Schönemann's theorem via a graph theoretic method.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Weight Enumerators of Some Classes of Deletion Correcting Codes.

[BibT_eX]

[DOI]

Olgica Milenkovic

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry.

[BibT_eX]

[DOI]

PhD thesis, 2017

2016

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

MMH<sup>⁎</sup> with arbitrary modulus is always almost-universal.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

On a variant of multilinear modular hashing with applications to authentication and secrecy codes.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

Restricted linear congruences.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Restricted linear congruences and an authenticated encryption scheme.

[BibT_eX]

[DOI]

CoRR, 2015

On almost-universal multilinear modular hashing with composite moduli.

[BibT_eX]

[DOI]

S. Venkatesh

CoRR, 2015

2014

On the Erdös-Gyárfás conjecture in claw-free graphs.

[BibT_eX]

[DOI]

Pouria Salehi Nowbandegani

Hossein Esfandiari

Mohammad Hassan Shirdareh Haghighi

Discuss. Math. Graph Theory, 2014

2013

Determinants of grids, tori, cylinders and Möbius ladders.

[BibT_eX]

[DOI]

Roberto Tauraso

Discret. Math., 2013

On the determinant of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition.

[BibT_eX]

[DOI]

Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2011

Degree-equipartite graphs.

[BibT_eX]

[DOI]

Mohammad Hassan Shirdareh Haghighi

Discret. Math., 2011

Additive combinatorics: with a view towards computer science and cryptography - An exposition

[BibT_eX]

[DOI]