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

Saračević, Muzafer; Korićanin, Edin; Biševac, Enver

doi:10.7251/jit1702069s

Cited by 5 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, a combination of polygon triangulations, Catalan numbers and cryptography is made. The paper [8] examines the possibilities of applying appropriate combinatorial problems (Ballot Problem, Stack permutations, and Balanced Parentheses) in the files and plain text encryption and decryption. Catalan numbers play an important role in data hiding and steganography.…”

Section: Review Of Related Researchmentioning

confidence: 99%

Authentication Based on the Image Encryption using Delaunay Triangulation and Catalan Objects

Selimović¹,

Stanimirović²,

Saračević³

et al. 2020

ACTA POLYTECH HUNG

Self Cite

View full text Add to dashboard Cite

This paper presents the authentication method using the Delaunay triangulation incremental algorithm and the Catalan objects. The proposed method is a combination of computational geometry and cryptography. This method presents a new step towards encoding the triangle coordinates using the Catalan-key. We provided specific suggestions for the application of this method in the authentication for bank clients by the image encryption. Client authentication verification is performed by asking the client to enter the (x,y) coordinate values of randomly selected indices of an array. If the entered coordinates match the index values in the banking system array, then the transaction or other operation is approved. If the matching fails, it means that we have an unidentified person who has followed the whole process and wants to break into the banking system. There are many advantages arising from a scenario for the user authentication by the assigned Catalan object and the stack permutation method. Also, we provided concrete examples for the Delaunay encryption of image with an authentication scenario and experimental results for the proposed method.

show abstract

Section: Review Of Related Researchmentioning

confidence: 99%

Authentication Based on the Image Encryption using Delaunay Triangulation and Catalan Objects

Selimović¹,

Stanimirović²,

Saračević³

et al. 2020

ACTA POLYTECH HUNG

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our previous papers [9,10], we are going to analyze the values that are generated in the C n set. For the purposes of Catalan number validity verification, we will use the binary notation.…”

Section: Cryptanalysis Of Catalan-keysmentioning

confidence: 99%

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

Saračević

Selimi

Selimović

2018

csci

View full text Add to dashboard Cite

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

show abstract

“…Our Java software solution for this case study consists of three segments [4,11]. The first phase involves finding Catalan numbers (keys) based on the given n basis.…”

Section: Experimental Work With Case Studiesmentioning

confidence: 99%

“…For details regarding the used Java classes, GUI and application functionality for LatticePath encryption method see our paper [11].…”

Section: Experimental Work With Case Studiesmentioning

confidence: 99%

Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography

Saračević¹,

Adamović²,

Biševac³

2018

ACTA POLYTECH HUNG

View full text Add to dashboard Cite

This paper analyzes the properties of Catalan numbers and their relation to the Lattice Path combinatorial problem in cryptography. Specifically, analyzes the application of the appropriate combinatorial problem based on Catalan-key in encryption and decryption of files and plaintext. Accordingly, we use Catalan numbers for generating keys and within the experimental part we have applied the NIST (National Institute of Standards and Technology) statistical battery of tests for assessing the quality of generated keys was applied. A total of 12 quality assurance tests for Catalan-key were applied. A Java application is presented which allows the encryption and decryption of plaintext based on the generated Catalan-key and combinatorial problem of movement in integer network orLattice Path. Experimental study yields the comparison of results in text encryption speed for combinatorial encryption methods (such as: Ballot Problem, Stack permutations and Balanced Parentheses) in comparison with Lattice Path method (in Java programming language).

show abstract

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

Cited by 5 publications

References 8 publications

Authentication Based on the Image Encryption using Delaunay Triangulation and Catalan Objects

Authentication Based on the Image Encryption using Delaunay Triangulation and Catalan Objects

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

Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography

Contact Info

Product

Resources

About