A binary tree interpretation of shared key generation using modular Ananta-graph paths

Vidyashree H. R.; Nagu Vadlana; Lakshminarayana S

doi:10.5269/bspm.82329

Vidyashree H. R. Department of Mathematics, REVA University, Bangalore, Karnataka-560064
Nagu Vadlana IIITDM Kurnool, AP https://orcid.org/0009-0004-4115-8186
Lakshminarayana S REVA University https://orcid.org/0000-0002-7182-757X

Abstract

This paper presents a formally grounded symmetric key agreement scheme based on modular traversal of Ananta-Graphs, reinterpreted and visualised through a binary tree model. The underlying encryption protocol is driven by the iterative dynamics of the Collatz-like transformation f(n) = (3n + 1) mod m, applied iteratively over a modular graph structure commencing from a shared public base node. Two communicating parties, Alice and Bob, independently traverse the graph using privately selected iteration counts, arriving at an identical shared secret without disclosing their private parameters. We introduce the AnantaGraph Traversal Inversion Problem (ATIP) and the Ananta-Graph Traversal Distinguishing Problem (ATDP), and formally argue their hardness by reduction from the Discrete Logarithm Problem (DLP) in a cyclic group setting, as well as through the non-linearity and many-to-one nature of the modular transformation. The shared traversal endpoint is processed through a hash-based Key Derivation Function (KDF) to obtain a cryptographically strong session key, decoupling key agreement from key usage and eliminating structural bias. A binary tree abstraction provides intuitive visualisation of the convergence properties of the scheme. Experimental results demonstrate that prime moduli produce substantially longer traversal cycles and superior key dispersion, confirming the practical viability of the proposed framework as a lightweight symmetric key agreement primitive.

Downloads

Download data is not yet available.

References

M. Bellare and P. Rogaway., Code-based game-playing proofs and the security of triple encryption, Springer, Berlin, 409-426, (2006).

D.J. Bernstein and T. Lange.,Post-quantum cryptography. Nature, 549, 188-194, (2017).

D. Boneh and V. Shoup.,A Graduate Course in Applied Cryptography. Draft. (2023).

D. Boneh and R. Venkatesan.,Breaking RSA may not be equivalent to factoring, Springer, Berlin, 59-71, (1998).

D.J. Bernstein, J. Buchmann, and E. Dahmen (Eds.), Post-Quantum Cryptography. Springer, Berlin, 1-22, (2009).

W. Diffie and M.E. Hellman.,New directions in cryptography. IEEE Trans. Inf. Theory, IT-22, 6 , 644-654, (1976).

M. Hildebrand., A survey on the mixing time of random walks on groups.Markov Chains and Mixing Times, 2nd ed. American Mathematical Society, (2017).

K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, and C. Park.New public-key cryptosystem using braid groups., Springer, Berlin, 166-183, (2000).

N. Koblitz.,Elliptic curve cryptosystems. Math. Comput., 48, 177, 203-209, (1987).

H. Krawczyk and P. Eronen., HKDF: A cryptographic key derivation function based on HMAC. IETF RFC 5869, (2010).

J.C. Lagarias (Ed.).,The Ultimate Challenge: The 3x+1 Problem. American Mathematical Society, Providence, RI, (2010)

E. Lubetzky and Y. Peres., Cutoff on all Ramanujan graphs. Geom. Funct. Anal., 26, 1190-1216, (2016).

R. Mallikarjuna and B. Pushpalatha., A symmetric cryptographic algorithm using a modified Collatz function. Int. J. Comput. Appl., 92, 17, 1-7, (2014).

A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone.Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, (1996).

R.C. Merkle.,Secure communications over insecure channels. Commun. ACM., 21, 4, 294-299, (1978).

V.S. Miller., Use of elliptic curves in cryptography, Springer, Berlin, 417-426, (1986).

B. Pushpalatha and P.K. Srimani.,Secure key exchange using Collatz-like problem. Int. J. Comput. Appl.,52, 3, 1-6, (2012).

O. Regev., On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56, 6, 1-40, (2009).

A. Rukhin et al., A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22, (2010).

P.K. Srimani and B. Pushpalatha., A new public key cryptosystem based on the Collatz problem. Int. J. Netw. Secur. Appl., 5, 4, 1-10, (2013).

W. Stallings., Cryptography and Network Security: Principles and Practice, 7th ed. Pearson, London, (2017).

H.R. Vidyashree and S. Lakshminarayana., Visualizing and proving the Collatz conjecture: An Ananta-graph approach. Commun. Appl. Nonlinear Anal., 32, 6s, 16-25, (2025).

H.R. Vidyashree and S. Lakshminarayana., Symmetric key encryption using modular traversal of Ananta-graphs. J. Inf. Syst. Eng. Manage. 10, 44s, 823-831, (2025).