Encryption based on Ballot, Stack permutations and Balanced Parentheses using Catalan-keys

Authors

  • Muzafer Saračević Department of Computer Sciences, University of Novi Pazar
  • Edin Korićanin Department of Computer Sciences, University of Novi Pazar
  • Enver Biševac Department of Computer Sciences, University of Novi Pazar

DOI:

https://doi.org/10.7251/JIT1702069S

Abstract

This paper examines the possibilities of applying Catalan numbers in cryptography. It also offers the application of appropriate combinatorial problems (Ballot Problem, Stack permutations and Balanced Parentheses) in encryption and decryption of files and plaintext. The paper analyzes the properties of Catalan numbers and their relation to these combined problems. Applied copyright method is related to the decomposition of Catalan numbers in the process of efficient keys generating. Java software solution which enables key generating with the properties of the Catalan numbers is presented at the end of the paper. Java application allows encryption and decryption of plaintext based on the generated key and combinatorial problems.

Published

2018-01-24

Issue

Section

Чланци