2021
DOI: 10.1007/s11042-021-11741-y
|View full text |Cite
|
Sign up to set email alerts
|

A new high capacity and secure image realization steganography based on ASCII code matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 50 publications
0
4
0
Order By: Relevance
“…A score of 0 indicates that no similarities were found between the strings, whereas a score of 1 indicates that they are the same. The three basic parts of this method are measuring the length of the string, finding strings of the same length, and enumerating the potential swaps [19]. To illustrate how [20] determines the separation (dj) between two strings (s1 and s2), consider the following:…”
Section: Cmentioning
confidence: 99%
“…A score of 0 indicates that no similarities were found between the strings, whereas a score of 1 indicates that they are the same. The three basic parts of this method are measuring the length of the string, finding strings of the same length, and enumerating the potential swaps [19]. To illustrate how [20] determines the separation (dj) between two strings (s1 and s2), consider the following:…”
Section: Cmentioning
confidence: 99%
“…2 3 , 9 , 21 . The given figure explores the concept of LSB by taking the cover image converting it into its corresponding American Standard Code Information Interchange (ASCII) values then converting it into binary values 22 . After reading the image pixels’ values and their binary forms it converts the secret message values to binary form 23 .…”
Section: Summary Of the Related Workmentioning
confidence: 99%
“…In order to obtain such a sequence from neighborhood subgraphs, we first randomly select neighborhood nodes, and then cross all nodes around the center node clockwise. The circular edit spacing problem is less complex than the graphic edit spacing problem, which can be solved according to the square relationship between time and space [9,10].…”
Section: Edit Distance Algorithmmentioning
confidence: 99%