Graphs with special arcs and cryptography
From MaRDI portal
The author studies a graph theory model for encryption of messages. The vertices of a graph represent possible messages and encryption steps to edges in the graph. Special graphs of high girth naturally arise in the area. The author presents a construction of some such graphs and discusses their properties. Applications in practice are also briefly sketched in the paper.
Recommendations
Cited in
(22)- On the homogeneous algebraic graphs of large girth and their applications
- Graph theory and the amateur cryptographer
- 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
- Some graph-based encryption schemes
- Outer-convex dominating set in the corona of graphs as encryption key generator
- Performance of algebraic graphs based stream-ciphers using large finite fields
- On the key expansion of \(D(n, K)\)-based cryptographical algorithm
- Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
- On small world semiplanes with generalised Schubert cells
- Fundamental circuits and cut-sets used in cryptography
- On new examples of families of multivariate stable maps and their cryptographical applications
- scientific article; zbMATH DE number 2081145 (Why is no real title available?)
- On Schubert cells in Grassmannians and new algorithms of multivariate cryptography
- Inner magic and inner antimagic graphs in cryptography
- A Survey on some Applications of Graph Theory in Cryptography
- Topological graph passwords based on the gracefulness of disconnected graphs with circles
- On the key exchange with new cubical maps based on graphs
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
- On the extremal graph theory for directed graphs and its cryptographical applications
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
- On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
This page was built for publication: Graphs with special arcs and cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862260)
