Adaptive Image Steganography Based on Graph Entropy with Improved Efficiency and Security

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ShamalizadehBaei M. A.; NOROZI Z.; SABZINEZHAD M.; KARAMI M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2017 | Volume:5 | Issue:2 (18) Page(s): 95-107

Download Full-Text

Persian Verion

View:

655

Download:

Cites:

Information Journal Paper

Title

Adaptive Image Steganography Based on Graph Entropy with Improved Efficiency and Security

Author(s)

ShamalizadehBaei M. A. | NOROZI Z. | SABZINEZHAD M. | KARAMI M.R. | Issue Writer Certificate

Keywords

LightweightQ1

LBlockQ1

Meet in the Middle AttackQ1

BicAdaptive SteganographyQ1

Entropy of GraphQ1

High Texture WindowQ1

SecurityQ1

Abstract

LBlock is a Lightweight block cipher, with a 64-bit block size and 80-bit key length. Biclique attack is a kind of MITM attack that has recently attracted lots of attention. Biclique cryptanalysis often breaks full version of the cipher on which many other existing attacks do not work. In this paper, firstly, asymmetric biclique is introduced, then by using low data complexity algorithm technique (LDC), a biclique attack on full round Lightweight block cipher LBlock is presented. The computation and data complexity of this attack are and, respectively. The data complexity is considerably less than the existing cryptanalytic result. The computational complexity remains the same as the previous ones.

Cites

No record.

References

No record.

Cite

APA: Copy

ShamalizadehBaei, M. A., NOROZI, Z., SABZINEZHAD, M., & KARAMI, M.R.. (2017). Adaptive Image Steganography Based on Graph Entropy with Improved Efficiency and Security. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 5(2 (18) ), 95-107. SID. https://sid.ir/paper/243078/en

Vancouver: Copy

ShamalizadehBaei M. A., NOROZI Z., SABZINEZHAD M., KARAMI M.R.. Adaptive Image Steganography Based on Graph Entropy with Improved Efficiency and Security. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2017;5(2 (18) ):95-107. Available from: https://sid.ir/paper/243078/en

IEEE: Copy

M. A. ShamalizadehBaei, Z. NOROZI, M. SABZINEZHAD, and M.R. KARAMI, “Adaptive Image Steganography Based on Graph Entropy with Improved Efficiency and Security,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 5, no. 2 (18) , pp. 95–107, 2017, [Online]. Available: https://sid.ir/paper/243078/en

Related Journal Papers