Generation of Cryptographic Keys with Algorithm of Polygon Triangulation and Catalan Numbers




Computational geometry, Polygon triangulation, Cryptography, Catalan number, balanced parentheses.


In this paper is presented a procedure for the application of one computational geometry algorithm in the process of generating hidden cryptographic keys from one segment of the 3D image. The presented procedure consists of three phases. In the first phase, is done the separation of one segment from the 3D image and determination of triangulation of the separated polygon. In the second phase, is done a conversion from the obtained triangulation of the polygon in the record which represent the Catalan key. In the third phase, the Catalan-key is applied in encryption of text based on the balanced parentheses combinatorial problem.


Download data is not yet available.


Amounas, F., El-Kinani, E.H., Hajar, M. Novel Encryption Schemes Based on Catalan Numbers, International Journal of Information & Network Security, 2013, Vol.2, No.4, pp. 339-347.

Cohen, E., Hansen, T., Itzhaki, N. From entanglement witness to generalized Catalan numbers, Scientific Reports, 2016, Vol.6, No.3.

Higgins, P.M. Number Story: From Counting to Cryptography, Springer Science & Business Media, Berlin, Germany, 2008.

Horak, P., Semaev, I., Tuza, I. Z. An application of Combinatorics in Cryptography, Electronic Notes in Discrete Mathematics, 2015, Vol. 49, pp. 31-35.

Koshy, T. Catalan Numbers with Applications, Oxford University Press, New York, 2009.

Kościelny, C., Kurkowski, M., Srebrny, M. Modern Cryptography Primer: Theoretical Foundations and Practical Applications, Springer Science & Business Media, Berlin, Germany, 2013.

Lachaud, G., Ritzenthaler, C., Tsfasman, M.A. Arithmetic, Geometry, Cryptography, and Coding Theory, American Mathematical Society, United States, 2009.

Saračević M., Stanimirović P., Mašović S., Biševac E, Implementation of the convex polygon trangulation algorithm, Facta Universitatis, series: Mathematics and Informatics Vol.27, No.2, pp. 213–228, 2012.

Saračević, M. Application of Catalan numbers and some combinatorial problems in cryptography (Bachelor's thesis), Faculty of Informatics and Computing, Singidunum University in Belgrade, 2017.

Saračević, M., Korićanin, E., Biševac, E. Encryption based on Ballot, Stack permutations and Balanced Parentheses using Catalan-keys, Journal of Information Technology and Applications, 2017, Vol.7, No.2, pp. 69-77.

Saračević, M. Methods for solving the polygon triangulation problem and their implementation (PhD thesis), Faculty of Science and Mathematics, University of Niš, 2013.

Stanimirović, P., Krtolica, P., Saračević, M., Mašović, S. Decomposition of Catalan numbers and Convex Polygon Triangulations, International Journal of Computer Mathematics, 2014, Vol. 91, No. 6, pp. 1315-1328.

Stanley, R. P. Catalan addendum to Enumerative Combinatorics, [on-line], 2012, [Available 24.05.2017.]




How to Cite

Saračević, M., Selimi, A., & Selimovic, F. (2018). Generation of Cryptographic Keys with Algorithm of Polygon Triangulation and Catalan Numbers. Computer Science, 19(3).




Most read articles by the same author(s)