cronokirby

(2026-03) On quadratic equations of q-regular tree and their applications in Graph Theory and Cryptography

2026-03-10

Abstract

Graphs D(n,q)D(n, q) and their connected components CD(n,q)CD(n, q) were defined 30 years ago. We observe shortly their applications to Extremal Graph Theory, Spectral Graph Theory, Algebraic Graph Theory, Symmetric Cryptography and Theory of Low Density Parity Check Codes. We introduce several new algorithms of Noncommutative Cryptography based on this graphs of large girth, In particular we propose modification of Diffie-Hellman protocol in terms of semigroup of walks of even length on the forest obtained as projective limit of D(n,q)D(n, q) and the homomorphic image of this monoid, acting on the vector space (Fq)n(F_q)^n as transformation group G(n,q)G(n, q) of cubical polynomial transformation. The protocol allows users to elaborate collision vector from (Fq)n(F_q)^n in time O(n2)O(n^2). The security of this schemes rests on the complexity of Conjugacy Power Problem for affine Cremona semigroup of automorphisms of Fq[x1,x2,…,xn]F_q[x_1, x_2, \dots, x_n]. Inverse protocol of El Gamal type allows to use these scheme for encryption or creating of digital signature. Several obfuscations of these algorithm are given.