The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index; none of the 3 sources its claims cite is checked for support yet.
Modified Least Significant Bit (MLSB)
Open accessAbstract
Now a day steganography plays a critical role in Information Security.Our work introduces modifications to existing steganography algorithm known as LSB "Least Significant Bit".The main idea of our work is to increase amount of data that can be hiding using LSB.In addition our algorithm encrypt data before hide it, which provide another level of protection over traditional LSB technique.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper modifies traditional LSB image steganography by converting 8-bit ASCII text into 5-bit codes with control symbols before hiding the bits in RGB pixel LSBs. It reports reduced bit requirements and a built-in form of encryption, demonstrated on an 18-character message hidden in a 160×160 image.
Key findings
- The algorithm represents characters and numbers with 5 bits instead of 8-bit ASCII, using control symbols: `1Bh` small letter, `1Ch` capital letter, `1Dh` space, `1Eh` number, and `1Fh` end of text.
- For the 18-character plaintext “STEGO with 05 bits,” ASCII requires `18 × 8 = 144` bits, while the proposed algorithm requires `22 × 5 = 110` bits, a difference of 34 bits.
- The same message needs at least `110/3` pixels, rounded to 37 pixels, and the experiment used a 160×160 pixel image; extraction returned the original message.
- The authors claim the conversion process provides built-in encryption because extracted bits are not understandable until converted back.
Methods
- Design: A 24-bit color image is used as the cover; message characters are converted from 8-bit ASCII to 5-bit codes, then hidden in the least significant bits of the Red, Green, and Blue components using LSB.
- Data/sample: One scenario with an 18-character text, “STEGO with 05 bits,” hidden in a 160×160 pixel image.
- Analysis: The paper compares bit requirements between ASCII and the proposed representation and verifies extraction by recovering the original message; no other quantitative analysis is reported.
Limitations
- Stated: If the text flips between small and capital letters for each character, the size will increase rather than decrease because of control symbols; the authors say such a scenario is rare.
- Evident: Evaluation is limited to a single 18-character message and one 160×160 image, with no security, detectability, robustness, or broader capacity analysis.
- Evident: No key or cryptographic algorithm is described for the claimed “encryption,” and no comparison is made against other enhanced LSB methods beyond the bit-count example.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
9 Own result · 8 Own interpretation · 3 Sources not found · 1 No basis given
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This text need at least image with (110/3) pixels (rounded to integer number = 37 pixels).”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainstates a causeSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In our algorithm we use just 5 bits to represent characters and numbers.”
- Also stated in: § 3. Experiment · plain
“The presented algorithm minimizes number of bits from 8 to 5.”
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § 3. Experiment · plain
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we can note the range from Bh to Fh is not used.So we use the successive from Bh to Fh as control symbol as shown in Table 4.”
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
plainstates a causen = 5- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we can see the difference between traditional representation and our algorithm is 34 bits.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The main idea of our work is to increase amount of data that can be hiding using LSB.”
- Also stated in: § 4. Conclusion · plain
“The advantage of our steganography algorithm is that it can hide larger amount of data than traditional LSB.”
§ Modified Least Significant Bit (MLSB) > Abstract
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § 4. Conclusion · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Accordingly the extracted message is: 53h,54h, 45h,47h,4fh,20h,77h,69h,74h,68h,20h,30h,35h,20h, 62h,69h,74h,73h This is the same as original message.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This gap will increase as the text extends in size, which gives us the opportunity to hide larger amount of data compared with traditional LSB.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainstates a causeSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“As LSB (Bandyopadhyay, Bhattacharyya, Ganguly, Mukherjeel, & Das, 2008) the output image of our algorithm will look identical to the cover image.”
§ Modified Least Significant Bit (MLSB) > 1. Introduction
What the sources say
- Not matchedcites Bandyopadhyay, Bhattacharyya, Ganguly, Mukherjeel, & Das, 2008
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The main disadvantage of our algorithm if the text flips between small and capital in each character.Then the size will increase not decrease because of control symbols.”
§ Modified Least Significant Bit (MLSB) > 4. Conclusion
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: Text that alternates between small and capital letters in each character is rare.
- Probably not a substantial claim. 7
- It may state two separate claims as one. 8
- The quote only partly states this claim. 2
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This will generate a very small difference, for human eye.”
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we can see the last three bits are identical so we can discard them.”
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Plain text of 18 characters:”
- Also stated in: § 3. Experiment · plain
“Our algorithm representation to the same message need (22 * 5) = 110 bits.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
- Also stated in: § 3. Experiment · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“According to our study if we look for ASCII representation we can note that, small letter character representation (hexadecimal) in the range between 61h to 7Ah , and capital letter character in the range between 41h to 5Ah.”
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In addition our algorithm encrypt data before hide it, which provide another level of protection over traditional LSB technique.”
- Also stated in: § 4. Conclusion · hedged
“In addition, we can consider that our algorithm perform built in encryption, because of conversion process.”
§ Modified Least Significant Bit (MLSB) > Abstract
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 4. Conclusion · hedged
In the paper
“The most widely used technique to hide data is the usage of LSB (Cox, Miller, Bloom, Fridrich, & Kalker, 2008).”
§ Modified Least Significant Bit (MLSB) > 1. Introduction
What the sources say
- Not matchedcites Cox, Miller, Bloom, Fridrich, & Kalker, 2008
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A statement the paper makes itself — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Because this method uses bits of each pixel in the image, it is necessary to use a lossless compression format, otherwise the hidden information will get lost in the transformation of a lossy compression algorithm.”
§ Modified Least Significant Bit (MLSB) > 1. Introduction
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“So our algorithm performs two operations in one scheme.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
A statement the paper makes itself — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“When using 24-bit color image, the least significant bit of each of the Red, Green, Blue color component can be used, so a total of 3 bits can be stored in each pixel.”
§ Modified Least Significant Bit (MLSB) > 1. Introduction
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our algorithm provide enhanced scheme over traditional LSB method.”
§ Modified Least Significant Bit (MLSB) > 4. Conclusion
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In addition we can consider it as encryption algorithm because if any one extract the bits from image he will note understand anything until decrypt it.”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
hedgedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“So to add another layer of protection we can encrypt the hidden message (Johnson & Jajodia, 1998).”
§ Modified Least Significant Bit (MLSB) > 1. Introduction
What the sources say
- Not matchedcites Johnson & Jajodia, 1998
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
The paper relies on this without support.
Text that alternates between small and capital letters in each character is rare.
“But we can say; such scenario is rare.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ Modified Least Significant Bit (MLSB) > hide the first 5-bits from z in the image using LSB technique
“If the control symbol represent characters (small (1Bh) or capital (1Ch)) then for each next five bits (which are not control symbol) perform OR with 60h to convert from 5-bit to 8-bit (ASCII).”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
“Accordingly the extracted message is: 53h,54h, 45h,47h,4fh,20h,77h,69h,74h,68h,20h,30h,35h,20h, 62h,69h,74h,73h”
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ Modified Least Significant Bit (MLSB) > 3. Experiment
“Plain text of 18 characters: "STEGO with 05 bits"”
§ Modified Least Significant Bit (MLSB) > 3. Experiment
“1eh,00h,05h,1bh,02h,09h,14h,13h,1fh”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Modified Least Significant Bit (MLSB) > 2. The Algorithm
“the first 4 bits again incremented from 1h to Ah to represents characters from 'P' to 'Z'”
§ Modified Least Significant Bit (MLSB) > 4. Conclusion
“| B | 42h | O | 4Fh | | C | 43h | P | 50h |”
Citations
Cites
Information Hiding Techniques for Steganography and Digital Watermarking
Katzenbeisser, S., & Petitcolas, F. A. P. (1999) · Cited by 1,895
Digital image steganography: Survey and analysis of current methods
Cheddad, A., Condell, J. V., Curran, K., & Kevitt, P. M. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.08.010 · Cited by 1,709
Information Hiding Techniques for Steganography and Digital Watermaking
Katzenbeisser, S., & Petitolas, F. (2000) · EDPACS · doi:10.1201/1079/43263.28.6.20001201/30373.5 · Cited by 384
Increasing Robustness of LSB Audio Steganography by Reduced Distortion LSB Coding
Cvejic, N., & Seppänen, T. (2020) · doi:10.3217/jucs-011-01-0056 · Cited by 59
SLSB: Improving the Steganographic Algorithm LSB
Roque, J. J. (2009) · International Workshop on Security in Information Systems (WOSIS) · doi:10.5220/0002169700570066 · Cited by 50
Research works printed but not linked: 3
- Bandyopadhyay, S. K., Bhattacharyya, D. , Ganguly, D. , Mukherjeel, S. & Das, P. (2008). A tutorial review on steganography. International Conference on Contemporary Computing.
- Cox, I. J., Miller, M. L., Bloom, J. A., Fridrich, J., Kalker, T. (2008). Digital watermarking and steganography(2nd. ed.). New York: Morgan Kaufmann.
- Johnson, N. F., & Jajodia, S. (1998). Steganography: seeing the unseen. IEEE Computer, (pp. 26-34).
Cited by
Sorted by citations
Secured and Robust Dual Image Steganography: A Survey
Prajapati, H. A., & Chitaliya, N. G. (2015) · International Journal of Innovative Research in Computer and Communication Engineering · doi:10.15680/ijircce.2015.0301006 · Cited by 16
Nasution, A. B., Efendi, S., & Suwilo, S. (2018) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1007/1/012010 · Cited by 16
Efficiency of LSB steganography on medical information
Abikoye, O. C., & Ogundokun, R. O. (2021) · International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering · doi:10.11591/ijece.v11i5.pp4157-4164 · Cited by 10
A novel framework for video content infringement detection and prevention
Kumar, G. S., Manikanta, G. C. S., & Srinivas, B. (2013) · International Conference on Advances in Computing, Communications and Informatics (ICACCI) · doi:10.1109/icacci.2013.6637209 · Cited by 5
Lubis, R. R. A., Hardi, S. M., Zarlis, M., et al. (2019) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1235/1/012081 · Cited by 3
“The MLSB algorithm is more efficient, since the number of insert character bits is modified to five bits only, so for one insertion character requires only five bytes of media cover (Zaher, 2011).”
Method
Metadata
- Authors
- Abu Zaher, M.
- Venue
- Computer and Information Science
- Published
- 2010-12-20
- Volume
- 4
- Issue
- 1
- ISSN
- 1913-8989 (ISSN-L)
- 1913-8997
- OpenAlex
- W45834962
- Semantic Scholar
- 1fea51df1ae31d902ee816025e474d094efcd093
- Cited by
- 16
- References
- 3
- Citations by year
- 2021: 2 · 2020: 1 · 2019: 3 · 2018: 1 · 2016: 1 · 2015: 4 · 2014: 1 · 2013: 3
- FWCI
- 1.10
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- Locations
- Computer and Information Science (publishedVersion, cc-by)
- Greater South Information System
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- steganography, least significant bit, information hiding, data encryption, information security
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-23, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-23 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
