On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
DOI10.1007/S11786-012-0121-XzbMATH Open1279.94093OpenAlexW2071256459MaRDI QIDQ1949050FDOQ1949050
Authors: Michał Klisowski, V. A. Ustimenko 
Publication date: 25 April 2013
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-012-0121-x
Recommendations
- scientific article; zbMATH DE number 5299614
- The implementation of cubic public keys based on a new family of algebraic graphs
- scientific article; zbMATH DE number 5708055
- On the key expansion of \(D(n, K)\)-based cryptographical algorithm
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
graph algorithmsalgebraic multivariate cryptographydensity of polynomial multivariate maps of small degree
Graph algorithms (graph-theoretic aspects) (05C85) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Title not available (Why is that?)
- New examples of graphs without small cycles and of large size
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- On the homogeneous algebraic graphs of large girth and their applications
- Explicit construction of graphs with an arbitrary large girth and of large size
- A new series of dense graphs of high girth
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the extremal regular directed graphs without commutative diagrams and their applications in coding theory and cryptography
- Graphs with special arcs and cryptography
- Title not available (Why is that?)
- Graph based private key crypto-system
- On the extremal graph theory for directed graphs and its cryptographical applications
- On some applications of graphs to cryptography and turbocoding
- Performance of algebraic graphs based stream-ciphers using large finite fields
- The implementation of cubic public keys based on a new family of algebraic graphs
- On extremal graph theory and symbolic computations
- On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
- On extremal graph theory, explicit algebraic constructions of extremal graphs and corresponding Turing encryption machines
- Title not available (Why is that?)
- Algebraic groups and small world graphs of high girth
- 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
Cited In (6)
- 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 new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
- Performance of algebraic graphs based stream-ciphers using large finite fields
- The implementation of cubic public keys based on a new family of algebraic graphs
Uses Software
This page was built for publication: On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949050)
