Enhanced Efficiency and Security in LSB2 Steganography: Burst Embedding and Private Key Integration
Bibliographic record
Abstract
In the realm of digital colour image steganography, the utilisation of an image key for the extraction of essential covering stego-bytes from predetermined secret positions was explored.The traditional Least Significant Bit (LSB) and LSB2 methodologies were streamlined by substituting the logical operations within both the hiding and extraction functions with straightforward assignment operations.An enhancement was introduced to the LSB2 steganographic methods for secret message conveyance without compromising data hiding capacity.Instead of the conventional character-by-character embedding seen in the LSB2 method, the binary code of the concealed message was embedded in a burst manner within the covering image.Similarly, the extraction from the stego image was conducted in a burst fashion, leading to a reduction in the processes required for both data hiding and extraction.As a result, shorter hiding and extraction durations were achieved, culminating in augmented data steganography throughput.For bolstering message security against potential breaches, the proposed ULSB2 method integrated a confidential private key (PK) composed of two double values.This key provisioned the necessary key space to deter hacking endeavours.A comparative analysis was conducted between the outcomes derived from the ULSB2 method and those of prevailing techniques to delineate the enhancements in both quality and speed of message steganography.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".