Secure Information Hiding Based on Random Similar Bit Mapping

Abdul Alif Zakaria ,Norli Anida Abdullah

doi:10.18178/ijmlc.2020.10.4.974

Abstract

Secure Information Hiding Based on Random Similar Bit Mapping

Highlights

The objective of security is to protect against those who may harm intentionally or unintentionally [1]
This paper proposed two steganography security measures based on Correct Position Finding (CPF) for message detection against a brute force attack
The locations of the hidden message are stored in a generated Position File (PF)

Summary

Introduction

The objective of security is to protect against those who may harm intentionally or unintentionally [1]. Security can be seen in many organizations but this research prioritizes communication and information security. Communication security protects technology, media, and content. Information security protects the confidentiality, integrity, and availability. Steganography defines as covered writing that aims to keep the existence of a hidden message from others [2]. Statistical method can detect the message existence [3]. Steganography is compared to cryptography due to their similarity in securing message but in different ways. Cryptography keeps the secrecy of the message but not its existence [4]. A known ciphertext paves the way for an attacker to apply cryptanalysis to gain the message [5]

Methods

Results

Conclusion