Home Technology Cryptographic method based on Catalan objects and enumerative chess problem
Chapter
Licensed
Unlicensed Requires Authentication

Cryptographic method based on Catalan objects and enumerative chess problem

  • Muzafer Saračević , Selver Pepić and Fadil Novalić
Become an author with De Gruyter Brill
Distributed Denial of Service Attacks
This chapter is in the book Distributed Denial of Service Attacks

Abstract

This chapter presents an analysis of the properties of Catalan numbers in the form of their objects and the possibility of application in data encryption. We present a new encryption method of text and image based on enumerative chess problem using Catalan-key. The proposed method consists of four phases: conversion, generation, selection, and inversion. The basic step is to convert text (or image) to binary notation and split binary sequence into blocks. Then, the next step is determining the start in the chessboard space and generating the Catalan-key. The third phase is a bit selection on the chessboard path based on the Catalan-key (object). The last step is the inversion of the selected bits. The proposed method was implemented in the JavaNetBeans environment. The NIST statistical tests were performed for the Catalan-keys (objects) generation through several aspects, where good results were obtained. In terms of DDoS attacks, we provided time and storage complexity of finding Catalan-keys, from which we can conclude that such a process is extremely burdensome for the hardware resources.

Abstract

This chapter presents an analysis of the properties of Catalan numbers in the form of their objects and the possibility of application in data encryption. We present a new encryption method of text and image based on enumerative chess problem using Catalan-key. The proposed method consists of four phases: conversion, generation, selection, and inversion. The basic step is to convert text (or image) to binary notation and split binary sequence into blocks. Then, the next step is determining the start in the chessboard space and generating the Catalan-key. The third phase is a bit selection on the chessboard path based on the Catalan-key (object). The last step is the inversion of the selected bits. The proposed method was implemented in the JavaNetBeans environment. The NIST statistical tests were performed for the Catalan-keys (objects) generation through several aspects, where good results were obtained. In terms of DDoS attacks, we provided time and storage complexity of finding Catalan-keys, from which we can conclude that such a process is extremely burdensome for the hardware resources.

Downloaded on 6.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110619751-003/html?lang=en
Scroll to top button