在ASCII字符上使用二进制数字映射来创建高容量、不可检测的文本隐写。

Saad Al-Azzam, Fahad Ali Al-Garni
{"title":"在ASCII字符上使用二进制数字映射来创建高容量、不可检测的文本隐写。","authors":"Saad Al-Azzam, Fahad Ali Al-Garni","doi":"10.32441/jaset.05.02.05","DOIUrl":null,"url":null,"abstract":"Plain text is commonly utilized for online news and social media transmission due to its lightweight and cross-platform nature. Unfortunately, it may easily be exploited by attackers (For instance, in cases when the language is altered for specific goals, illegal access to the material or its abuse is possible.) To solve this problem, we embed secret texts (ST) within seemingly innocuous cover texts (CT) so that we can track CT for modifications. Based on the findings of this study, a method is provided for ST embedding in CT in which binary ST digits are converted to CT binary digits through Characters in ASCII (containing whitespace, punctuation, and special characters). Before commencing the embedding procedure, Using a One-Time Pad (OTP), the ST text was translated into ciphertext, and the value of each character was changed into a binary integer with a length of seven bits. As opposed to the ST text, which required additional time to encode, the CT text could be converted into a binary integer using just the first seven bits. During the embedding process, It was decided to swap the first bit of the ST character for the first bit of the CT character, which both had the same amount of bits (putting the first bit of the ST character, for example, on the same line as the first bit of the CT character). Any piece of ST that was recorded on any bit of CT served as a stage key. Extracting ST from CT requires the stage key. The embedded information served effectively as text steganography or watermark, and the CT's appearance was unaffected by the embedding procedure. In other words, the 1 character of ST might be concealed by using 7 CT characters. Also, a Jaro-Winkler Distance of 1 meant that the stage texts made couldn't be told apart from CT by looking at them.","PeriodicalId":431188,"journal":{"name":"Journal of Advanced Sciences and Engineering Technologies","volume":"127 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The use of binary digit mapping on ASCII characters to create a high-capacity, undetectable text steganography.\",\"authors\":\"Saad Al-Azzam, Fahad Ali Al-Garni\",\"doi\":\"10.32441/jaset.05.02.05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Plain text is commonly utilized for online news and social media transmission due to its lightweight and cross-platform nature. Unfortunately, it may easily be exploited by attackers (For instance, in cases when the language is altered for specific goals, illegal access to the material or its abuse is possible.) To solve this problem, we embed secret texts (ST) within seemingly innocuous cover texts (CT) so that we can track CT for modifications. Based on the findings of this study, a method is provided for ST embedding in CT in which binary ST digits are converted to CT binary digits through Characters in ASCII (containing whitespace, punctuation, and special characters). Before commencing the embedding procedure, Using a One-Time Pad (OTP), the ST text was translated into ciphertext, and the value of each character was changed into a binary integer with a length of seven bits. As opposed to the ST text, which required additional time to encode, the CT text could be converted into a binary integer using just the first seven bits. During the embedding process, It was decided to swap the first bit of the ST character for the first bit of the CT character, which both had the same amount of bits (putting the first bit of the ST character, for example, on the same line as the first bit of the CT character). Any piece of ST that was recorded on any bit of CT served as a stage key. Extracting ST from CT requires the stage key. The embedded information served effectively as text steganography or watermark, and the CT's appearance was unaffected by the embedding procedure. In other words, the 1 character of ST might be concealed by using 7 CT characters. Also, a Jaro-Winkler Distance of 1 meant that the stage texts made couldn't be told apart from CT by looking at them.\",\"PeriodicalId\":431188,\"journal\":{\"name\":\"Journal of Advanced Sciences and Engineering Technologies\",\"volume\":\"127 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced Sciences and Engineering Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.32441/jaset.05.02.05\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Sciences and Engineering Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32441/jaset.05.02.05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

纯文本由于其轻量级和跨平台的特性,通常用于在线新闻和社交媒体传输。不幸的是,它可能很容易被攻击者利用(例如,当语言被修改为特定目标时,非法访问材料或滥用材料是可能的)。为了解决这个问题,我们将秘密文本(ST)嵌入到看似无害的封面文本(CT)中,以便我们可以跟踪CT进行修改。基于本研究的发现,提出了一种ST嵌入CT的方法,该方法通过ASCII字符(包含空格、标点符号和特殊字符)将二进制ST数字转换为CT二进制数字。在开始嵌入程序之前,使用一次性Pad (OTP)将ST文本翻译成密文,并将每个字符的值更改为长度为7位的二进制整数。与需要额外时间编码的ST文本相反,CT文本可以仅使用前7位转换为二进制整数。在嵌入过程中,决定将ST字符的第一个比特交换为CT字符的第一个比特,两者具有相同的位数(例如,将ST字符的第一个比特与CT字符的第一个比特放在同一行)。任何一段ST被记录在CT的任何位上都可以作为舞台钥匙。从CT中提取ST需要阶段密钥。嵌入的信息可以有效地作为文本隐写或水印,并且CT的外观不受嵌入过程的影响。换句话说,使用7个CT字符可能会隐藏ST的1个字符。此外,Jaro-Winkler距离为1意味着不能通过观察将舞台文本与CT区分开来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The use of binary digit mapping on ASCII characters to create a high-capacity, undetectable text steganography.
Plain text is commonly utilized for online news and social media transmission due to its lightweight and cross-platform nature. Unfortunately, it may easily be exploited by attackers (For instance, in cases when the language is altered for specific goals, illegal access to the material or its abuse is possible.) To solve this problem, we embed secret texts (ST) within seemingly innocuous cover texts (CT) so that we can track CT for modifications. Based on the findings of this study, a method is provided for ST embedding in CT in which binary ST digits are converted to CT binary digits through Characters in ASCII (containing whitespace, punctuation, and special characters). Before commencing the embedding procedure, Using a One-Time Pad (OTP), the ST text was translated into ciphertext, and the value of each character was changed into a binary integer with a length of seven bits. As opposed to the ST text, which required additional time to encode, the CT text could be converted into a binary integer using just the first seven bits. During the embedding process, It was decided to swap the first bit of the ST character for the first bit of the CT character, which both had the same amount of bits (putting the first bit of the ST character, for example, on the same line as the first bit of the CT character). Any piece of ST that was recorded on any bit of CT served as a stage key. Extracting ST from CT requires the stage key. The embedded information served effectively as text steganography or watermark, and the CT's appearance was unaffected by the embedding procedure. In other words, the 1 character of ST might be concealed by using 7 CT characters. Also, a Jaro-Winkler Distance of 1 meant that the stage texts made couldn't be told apart from CT by looking at them.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信