Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

A Secure and Optimal Method of Steganography Using Bit Combination and Dynamical Rotation over Addresses

Version 1 : Received: 26 February 2019 / Approved: 27 February 2019 / Online: 27 February 2019 (11:47:18 CET)
Version 2 : Received: 18 March 2019 / Approved: 20 March 2019 / Online: 20 March 2019 (15:43:30 CET)
Version 3 : Received: 28 January 2022 / Approved: 31 January 2022 / Online: 31 January 2022 (12:57:32 CET)

A peer-reviewed article of this Preprint also exists.

Okello, M. O. (2022). Optimal Covert Communication Techniques . International Journal of Informatics and Applied Mathematics , 5 (1) , 1-26 . DOI: 10.53508/ijiam.1073205 Okello, M. O. (2022). Optimal Covert Communication Techniques . International Journal of Informatics and Applied Mathematics , 5 (1) , 1-26 . DOI: 10.53508/ijiam.1073205

Abstract

Steganography is the branch of cryptology that deals with concealing information inside another information. it’s prefer over cryptography as it hides a message inside another innocent looking message, while cryptography shows scrambled message that might arouse attention of an attacker, however the challenges in steganography is the modification of carrier that causes some abnormalities which is detectable and often the methods are not optimize. This paper presents a novel approach in cryptography and steganography, which utilizes mathematical concept of bits combination to optimize time of transmission using sets of multiple transmitter, and receiver’s addresses where each abstractly represents a bits combination without itself modified. In addition, the paper introduces a concept of dynamical clockwise and anti-clockwise rotation of bits combination over addresses after every transmission to reinforce resistivity against steganalysis.

Keywords

General Mathematics, Combinatorial, Algebra, Steganography, Probability, Cryptography

Subject

Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.