The Hiding of Secret Data Using the Run Length Matching Method

  • Authors:

  • Ki-Hyun Jung;Jae-Gil Yu;Se-Min Kim;Ki-Jong Kim;Jin-Yong Byun;Kee-Young Yoo

  • Affiliations:

  • Division of Computer Information, Yeungjin College, 218 Bokhyun-Dong, Buk-Gu, Daegu 702-721, Republic of Korea;Department of Computer Engineering, Kyungpook National University, 1370 Sankyuk-Dong, Buk-Gu, Daegu 702-701, Republic of Korea;Department of Computer Engineering, Kyungpook National University, 1370 Sankyuk-Dong, Buk-Gu, Daegu 702-701, Republic of Korea;Division of Computer Information, Yeungjin College, 218 Bokhyun-Dong, Buk-Gu, Daegu 702-721, Republic of Korea;Division of Computer Information, Yeungjin College, 218 Bokhyun-Dong, Buk-Gu, Daegu 702-721, Republic of Korea;Division of Computer Information, Yeungjin College, 218 Bokhyun-Dong, Buk-Gu, Daegu 702-721, Republic of Korea

  • Venue:
  • KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This study proposes a data hiding method based on run length encoding. This proposed method uses the location of accumulated run length values, where the cover data run length are compared with the secret data run length. The run length matching (RLM) method uses the run length table which is constructed from the cover and secret data. The experimental results demonstrated that the RLM has advantages with respect to different types of data and run length encoding value match.