Implementation of the Gauss-Circle Map for encrypting and embedding simultaneously on digital image and digital text

Abstract This paper discusses implementation of Gauss-Circle Map (GCM) in cryptography and steganography process simultaneously. Cryptography is used for securing data confidentiality, while steganography is used to protect the existence of data. The objects that used in this thesis are digital text...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1821; no. 1; p. 12037
Main Authors Suryadi, MT, Satria, Yudi, Hadidulqawi, Azzam
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.03.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Abstract This paper discusses implementation of Gauss-Circle Map (GCM) in cryptography and steganography process simultaneously. Cryptography is used for securing data confidentiality, while steganography is used to protect the existence of data. The objects that used in this thesis are digital text and digital images. This research was conducted by designing algorithms for encryption and embedding simultaneously, as well as extraction and decryption simultaneously then implement it with python programming. Results obtained from the observation shows that GCM had randomness level 100% using NIST test with chosen parameter x 0 (1) = x 0 (2) = 0, α (1) = α (2) = 9, β (1) = β (2) = 0.481, K (1) = K (2) = 1000000, and Ω (1) = Ω (2) = 0.5. Algorithm that have been designed have varying degrees of sensitivity according to different parameters, and high key spaces that reaches 2.6244 × 10 1269 . Encrypted image is uniformly distributed since it passes goodness of fit test. Correlation coefficient values of the stego image are at interval [0.89,1] and very close to correlation coefficient values of the cover image. However, Peak Signal to Noise Ratio (PSNR) of the stego image did not meet standard (above 40 dB). Here, the extracted-decrypted stego image have perfect similarity with the original image.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1821/1/012037