Permutation Encoding for Text Steganography: A Short Tutorial

04/08/2021
by   George D. Montanez, et al.
0

We explore a method of encoding secret messages using factoradic numbering of permuted lists of text or numeric elements. Encoding and decoding methods are provided, with code, and key aspects of the correctness of the methods are formally proven. The method of encoding is simple and provides a working example of using textual and numeric lists as a stenagographic channel. Given the ubiquity of lists, such channels are already present but are often unused.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/24/2018

When You Should Use Lists in Haskell (Mostly, You Should Not)

We comment on the over-use of lists in functional programming. With this...
12/21/2017

Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations

Several graph theoretic watermark methods have been proposed to encode n...
01/06/2022

A simple coding-decoding algorithm for the Hamming code

In this work, we present a new simple way to encode/decode messages tran...
10/20/2021

Steganography of Complex Networks

Steganography is one of the information hiding techniques, which conceal...
07/05/2020

Universal codes in the shared-randomness model for channels with general distortion capabilities

We put forth new models for universal channel coding. Unlike standard co...
10/12/2018

Thresholds quantifying proportionality criteria for election methods

We define several different thresholds for election methods by consideri...
03/07/2020

Frozen Binomials on the Web: Word Ordering and Language Conventions in Online Text

There is inherent information captured in the order in which we write wo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.