THE USE OF NOISELESS STEGANOGRAPHIC PARADIGM IN RUBIK’S CUBE

<p align="justify">Steganography is the art and science of hiding messages in such a way that except the sender and receiver, no one is aware that there is a secret message. Steganography is divided into two types: Noisy Steganography and Noiseless Steganography. With noiseless stega...

Full description

Saved in:
Bibliographic Details
Main Author: YUSUF RAHARDIAN - NIM : 13514079 , ADE
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/24975
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
Description
Summary:<p align="justify">Steganography is the art and science of hiding messages in such a way that except the sender and receiver, no one is aware that there is a secret message. Steganography is divided into two types: Noisy Steganography and Noiseless Steganography. With noiseless steganography, the cover does not have any noise because the message is the cover itself. Therefore, the noiseless data on the generated cover uses original data or data that can not be traced so as to avoid attacks. Noiseless steganography in the domain of game has been applied in the game of chess, Tetris, and Minesweeper. In this final project, a secret message will be embedded on the cover which is a collection of Rubik’s Cube scrambles. To make sure the Rubik’s Cube scrambles are always different even if the message is the same, permutation information is embedded in the first scramble. Permutation information is used to randomize the encoding table. In the second scramble, length information is embedded. Length information is used to determine the number of notations in the third scramble and so on which contains a secret message. The application built in the form of Rubik’s Cube timer will generate scrambles when the user plays it. The timer created is a web-based application developed with Flask framework. The experiment results show that the application is able to pass all the functional requirements so it can work like a standard timer. In addition, the probability value of each notation has a uniform distribution with an entropy value close to the maximum value. For each scramble with about 20 notations, the proposed method can embed up to 66 bits per scramble. Based on statistical theories and experiment results, the generated cover is resistant to attack.<p align="justify">