A steganography method based on decomposition of the Catalan numbers

Saračević, Muzafer; Jukić, Samed; Hasanović, Adnan

doi:10.1016/b978-0-12-819438-6.00016-5

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

“…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%

“…In this case, we will present the Lattice Path combinatorial encryption methods. In this way, a effective system performance for encryption is achieved [4].…”

Section: Introductionmentioning

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

show abstract

Novel Steganographic Method Based on Hermitian Positive Definite Matrix and Weighted Moore–Penrose Inverses

Pepić,

Saračević,

Selim

et al. 2024

Applied Sciences

View full text Add to dashboard Cite

In this paper, we describe the concept of a new data-hiding technique for steganography in RGB images where a secret message is embedded in the blue layer of specific bytes. For increasing security, bytes are chosen randomly using a random square Hermitian positive definite matrix, which is a stego-key. The proposed solution represents a very strong key since the number of variants of positive definite matrices of order 8 is huge. Implementing the proposed steganographic method consists of splitting a color image into its R, G, and B channels and implementing two segments, which take place in several phases. The first segment refers to embedding a secret message in the carrier (image or text) based on the unique absolute elements values of the Hermitian positive definite matrix. The second segment refers to extracting a hidden message based on a stego-key generated based on the Hermitian positive definite matrix elements. The objective of the data-hiding technique using a Hermitian positive definite matrix is to embed confidential or sensitive data within cover media (such as images, audio, or video) securely and imperceptibly; by doing so, the hidden data remain confidential and tamper-resistant while the cover media’s visual or auditory quality is maintained.

show abstract

Application of Delaunay Triangulation and Catalan Objects in Steganography

et al. 2021

View full text Add to dashboard Cite

This paper presents a new method of steganography based on a combination of Catalan objects and Voronoi–Delaunay triangulation. Two segments are described within the proposed method. The first segment describes the process of embedding data and generating a complex stego key. The second segment explains the extraction of a hidden message. The main goal of this paper is to transfer a message via the Internet (or some other medium) using an image so that the image remains absolutely unchanged. In this way, we prevented the potential attacker from noticing some secret message hidden in that picture. Additionally, the complex stego key consists of three completely different parts (the image, the encrypted Delaunay triangulation, and the array Rk in Base64 code), which are very difficult to relate with each other. Finally, a few security analyses of the proposed method are conducted, as well as the corresponding steganalysis.

show abstract

A steganography method based on decomposition of the Catalan numbers

Cited by 3 publications

References 11 publications

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

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

Novel Steganographic Method Based on Hermitian Positive Definite Matrix and Weighted Moore–Penrose Inverses

Application of Delaunay Triangulation and Catalan Objects in Steganography

Contact Info

Product

Resources

About