Expanding graphs of the Extremal Graph Theory and expanded platforms of Post Quantum Cryptography
Vasyl Ustimenko, Urszula Romańczuk, Aneta Wróblewska · Annals of Computer Science and Information Systems · 2019
Explicit constructions in Extremal Graph Theory give appropriate lower bounds for Turan type problems.In the case of prohibited cycles, the explicit constructions can be used for various problems of Information Security.We observe recent applications of algebraic constructions of regular graphs of large girth and graphs with large cycle indicator to Coding Theory and Cryptography.In particular, we present a new multivariate platforms of postquantum Non-commutative Cryptography defined in graph theoretical terms.