On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines

DOI10.1007/978-3-642-29694-9_11zbMath1277.94040OpenAlexW158450660MaRDI QIDQ2866112

Urszula Romańczuk, Vasiliy A. Ustimenko

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_11

Mathematics Subject Classification ID

Related Items (7)

On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition ⋮ On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications ⋮ On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups ⋮ On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree ⋮ On the comparison of cryptographical properties of two different families of graphs with large cycle indicator ⋮ On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2 ⋮ LDPC Codes Based on Algebraic Graphs

This page was built for publication: On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines