On the comparison of cryptographical properties of two different families of graphs with large cycle indicator

DOI10.1007/S11786-012-0121-XMaRDI QIDQ1949050zbMATH OpenOpenAlexFDO

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

graph algorithms algebraic multivariate cryptography density of polynomial multivariate maps of small degree

Graph algorithms (graph-theoretic aspects) (05C85) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

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

Cites work

scientific article; zbMATH DE number 3841900 (Why is no real title available?)
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 5783701 (Why is no real title available?)
scientific article; zbMATH DE number 2081145 (Why is no real title available?)
A new series of dense graphs of high girth
Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
Algebraic groups and small world graphs of high girth
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 group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
Graph based private key crypto-system
Graphs with special arcs and cryptography
New examples of graphs without small cycles and of large size
On dynamical systems of large girth or cycle indicator and their applications to multivariate cryptography
On extremal graph theory and symbolic computations
On extremal graph theory, explicit algebraic constructions of extremal graphs and corresponding Turing encryption machines
On some applications of graphs to cryptography and turbocoding
On the extremal graph theory for directed graphs and its cryptographical applications
On the extremal regular directed graphs without commutative diagrams and their applications in coding theory and cryptography
On the homogeneous algebraic graphs of large girth and their applications
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
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

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

Describes a project that uses

Uses Software

CRYPTIM

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)