On the key expansion of D(n, K)-based cryptographical algorithm
From MaRDI portal
Publication:2442944
Recommendations
- On the key exchange with new cubical maps based on graphs
- The implementation of cubic public keys based on a new family of algebraic graphs
- 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 family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
- On the key exchange with matrices of large order and graph based nonlinear maps
Cites work
- A characterization of the components of the graphs \(D(k,q)\)
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Explicit construction of graphs with an arbitrary large girth and of large size
- Explicit constructions of graphs without short cycles and low density codes
- Graphs with special arcs and cryptography
- scientific article; zbMATH DE number 5299614 (Why is no real title available?)
- scientific article; zbMATH DE number 5708055 (Why is no real title available?)
- scientific article; zbMATH DE number 4059444 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 2081145 (Why is no real title available?)
- scientific article; zbMATH DE number 1381084 (Why is no real title available?)
- scientific article; zbMATH DE number 5025700 (Why is no real title available?)
- On some properties of graph based public keys
- On the extremal graph theory for directed graphs and its cryptographical applications
- On the implementation of cubic public keys based on algebraic graphs over the finite commutative rings and their symmetries
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
- On the key exchange with nonlinear polynomial maps of degree 4
Cited in
(10)- 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
- The implementation of cubic public keys based on a new family of algebraic graphs
- Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- On the key exchange with matrices of large order and graph based nonlinear maps
- On some properties of graph based public keys
- On the implementation of cubic public keys based on algebraic graphs over the finite commutative rings and their symmetries
- On the key exchange with new cubical maps based on graphs
This page was built for publication: On the key expansion of \(D(n, K)\)-based cryptographical algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442944)