Source and Channel Models for Secret-Key Agreement Based on Catalan Numbers and the Lattice Path Combinatorial Approach

This paper presents a solution to secret key sharing protocol problem that establishes cryptographically secured communication between two entities. We propose a new symmetric cryptographic key exchange scenario based on the specific properties of Catalan numbers and the Lattice Path combinatorics. Our scenario consists of three phases: generating Catalan values, defining the Lattice Path movement space and defining the key equalization rules. In the experimental part of this study, we have merged our scenario with the Maurer‟s protocol, while in the information-theoretical approach to the key exchange we have presented how a partially split bit sequence can become the secret key that both parties in communication can use. Maurer's satellite scenario model for the exchange of the Catalan key is discussed in detail and its application is proposed. Security analysis of the protocol and testing for channel capacity or key generation speed is also suggested.

[1]  A. Tuzikov,et al.  Analysis of random point images with the use of symbolic computation codes and generalized Catalan numbers , 2016 .

[2]  Muzafer Saračević,et al.  Encryption based on Ballot, Stack permutations and Balanced Parentheses using Catalan-keys , 2018 .

[3]  Flavia Colonna,et al.  Function Series, Catalan Numbers, and Random Walks on Trees , 2005, Am. Math. Mon..

[4]  Kyungyong Lee,et al.  q,t-Catalan Numbers and Generators for the Radical Ideal defining the Diagonal Locus of (C2)n , 2009, Electron. J. Comb..

[5]  Xing-Lan Zhang.  Authenticated Key Exchange Protocol in One-Round , 2009, ICA3PP.

[6]  Li Chen,et al.  On the Catalan Numbers and Some of Their Identities , 2019, Symmetry.

[7]  Samiran Chattopadhyay,et al.  A novel secure key-exchange protocol using biometrics of the sender and receiver , 2017, Comput. Electr. Eng..

[8]  Mathilde Bouvel,et al.  Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers , 2019, Theor. Comput. Sci..

[9]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[10]  P. Stanimirović,et al.  Construction and Notation of Convex Polygon Triangulation Based on Ballot Problem , 2014 .

[11]  T. Koshy.  Catalan Numbers with Applications , 2008 .

[12]  Samiran Chattopadhyay,et al.  An Approach to Cryptographic Key Exchange Using Fingerprint , 2014, SSCC.

[13]  Aybeyan Selimi,et al.  Generation of Cryptographic Keys with Algorithm of Polygon Triangulation and Catalan numbers , 2018, Comput. Sci..

[14]  Alaa Fahmy.  Key Exchange Protocol over Insecure Channel , 2007 .

[15]  A. A. Obzor,et al.  GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS , 2017 .

[16]  S. Adamovic,et al.  Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography , 2018 .

[17]  Ueli Maurer,et al.  A universal statistical test for random bit generators , 1990, Journal of Cryptology.

[18]  Jianying Zhou,et al.  Further analysis of the Internet key exchange protocol , 2000, Comput. Commun..

[19]  Karl-Heinz Zimmermann,et al.  Key Exchange Protocol using Permutation Parity Machines , 2009, IJCCI.

[20]  Jin Zhang,et al.  A Note on the Sequence Related to Catalan Numbers , 2019, Symmetry.

[21]  Muzafer Saračević,et al.  A novel approach to steganography based on the properties of Catalan numbers and Dyck words , 2019, Future Gener. Comput. Syst..

[22]  Feng Qi (祁锋),et al.  SEVERAL SERIES IDENTITIES INVOLVING THE CATALAN NUMBERS , 2017 .

[23]  Gwo Dong Lin.  On powers of the Catalan number sequence , 2019, Discret. Math..