On some properties of graph based public keys
From MaRDI portal
Publication:3621174
Recommendations
- The implementation of cubic public keys based on a new family of algebraic graphs
- On multivariate public keys based on a pair of transformations with density gap
- On the key expansion of \(D(n, K)\)-based cryptographical algorithm
- scientific article; zbMATH DE number 5025700
- Permutation polynomials and a new public-key encryption
Cited in
(15)- scientific article; zbMATH DE number 219244 (Why is no real title available?)
- Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
- On the key expansion of \(D(n, K)\)-based cryptographical algorithm
- scientific article; zbMATH DE number 5299614 (Why is no real title available?)
- On multivariate cryptosystems based on computable maps with invertible decomposition
- On new examples of families of multivariate stable maps and their cryptographical applications
- Keyed hash function from large girth expander graphs
- On the key exchange with new cubical maps based on graphs
- Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree
- scientific article; zbMATH DE number 1737506 (Why is no real title available?)
- Performance of algebraic graphs based stream-ciphers using large finite fields
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
This page was built for publication: On some properties of graph based public keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621174)
