On LDPC codes corresponding to affine parts of generalized polygons. - Monika Polak; Vasyl Ustimenko (Ann. UMCS Informatica, 2011)

On LDPC Codes Corresponding to Infinite Family of Graphs A(k;K). - Monika Polak; Vasyl Ustimenko (FedCSIS, 2012)

LDPC Codes Based on Algebraic Graphs. - Monika Polak; Vasyl Ustimenko (Ann. UMCS Informatica, 2012)

Examples of Ramanujan and expander graphs for practical applications. - Monika Polak; Vasyl Ustimenko (FedCSIS, 2013)

On the applications of Extremal Graph Theory to Coding Theory and Cryptography. - Monika Polak; Urszula Romanczuk; Vasyl Ustimenko; Aneta Wróblewska (Electron. Notes Discret. Math., 2013)

On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups. - Monika Polak; Vasyl Ustimenko (CSS, 2014)

Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes. - Monika Polak; Vasyl Ustimenko (Ann. UMCS Informatica, 2015)

Graph based linear error correcting codes. - Monika Polak; Eustrat Zhupa (CoRR, 2016)

On the implementation of new symmetric ciphers based on non-bijective multivariate maps. - Vasyl Ustimenko; Urszula Romanczuk-Polubiec; Aneta Wróblewska; Monika Polak; Eustrat Zhupa (FedCSIS, 2018)

Accelerating Multivariate Cryptography with Constructive Affine Stream Transformations. - Michael Carenzo; Monika Polak (FedCSIS, 2019)

Keyed hash function from large girth expander graphs. - Eustrat Zhupa; Monika K. Polak (CoRR, 2019)

On the Constructions of New Symmetric Ciphers Based on Nonbijective Multivariate Maps of Prescribed Degree. - Vasyl Ustimenko; Urszula Romanczuk-Polubiec; Aneta Wróblewska; Monika Katarzyna Polak; Eustrat Zhupa (Secur. Commun. Networks, 2019)

Designing and Delivering a Post-Quantum Cryptography Course. - Thomas J. Borrelli; Monika Polak; Stanislaw P. Radziszowski (SIGCSE (1), 2024)

Towards a Quantum-Resistant Future: Experiences in Post-Quantum Cryptography Education. - Thomas J. Borrelli; Sumita Mishra; Monika Polak; Stanislaw P. Radziszowski (SIGCSE (2), 2025)