Article
Version 1
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 2 : Received: 18 March 2019 / Approved: 20 March 2019 / Online: 20 March 2019 (15:43:30 CET)
How to cite: Okello, M. A Secure and Optimal Method of Steganography Using Bit Combination and Dynamical Rotation over Addresses. Preprints 2019, 2019020252 (doi: 10.20944/preprints201902.0252.v1). Okello, M. A Secure and Optimal Method of Steganography Using Bit Combination and Dynamical Rotation over Addresses. Preprints 2019, 2019020252 (doi: 10.20944/preprints201902.0252.v1).
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.
Subject Areas
General Mathematics, Combinatorial, Algebra, Steganography, Probability, Cryptography
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.
Leave a public commentSend a private comment to the author(s)