An Improved Image Scrambling Algorithm

Che, Shengbing; Che, Zuguo; Ma, Bin

doi:10.1109/wgec.2008.7

Cited by 5 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Others [7][8][9][10][11][12] have attempted scrambling using random sequences based on chaos or pseudo random number generation based on parameters. Zhou et.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Key-Based Scrambling for Secure Image Communication

Premaratne

2012

Communications in Computer and Information Science

View full text Add to dashboard Cite

Secure image communication is becoming increasingly important due to theft and manipulation of its content. Law enforcement agents may find it increasingly difficult to stay afloat above the ill intentions of hackers. We have been able to develop an image scrambling algorithm that is very simple to implement but almost impossible to breach with a probability less than 5x10− 300. This is possible due to the fact that a user may purchase or acquire rights for an intended image by specifying a 'key' that can form a sequence of numbers 10 to 100 in length. The content provider uses this sequence as a base in developing another key sequence to scramble the image and transmit it to the user through regular channels such as an email attachment. Since the user is the only party apart from the provider to possess the key for descrambling, any third party will not be able to descramble it successfully as will be shown in this paper. Abstract. Secure image communication is becoming increasingly important due to theft and manipulation of its content. Law enforcement agents may find it increasingly difficult to stay afloat above the ill intentions of hackers. We have been able to develop an image scrambling algorithm that is very simple to implement but almost impossible to breach with a probability less than 5x10 -300 . This is possible due to the fact that a user may purchase or acquire rights for an intended image by specifying a 'key' that can form a sequence of numbers 10 to 100 in length. The content provider uses this sequence as a base in developing another key sequence to scramble the image and transmit it to the user through regular channels such as an email attachment. Since the user is the only party apart from the provider to possess the key for descrambling, any third party will not be able to descramble it successfully as will be shown in this paper.

show abstract

“…Others [7][8][9][10][11][12] have attempted scrambling using random sequences based on chaos or pseudo random number generation based on parameters. Zhou et.…”

Section: Introductionmentioning

confidence: 99%

“…Since the sequence generation is not governed by few numbers of parameter as has been reported before [7][8][9][10][11][12], a sequence that is almost 100 values long will almost be impossible to crack. Since the algorithm does not affect the pixel values of the image, its histogram and the content remain unchanged.…”

mentioning

confidence: 99%

Key-Based Scrambling for Secure Image Communication

Premaratne

2012

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…Information hiding technique based on spatial domain is implemented by directly changing the pixels' values of the image, and watermarking information is usually embedded into image's bright bands and color bands. The most simple and typical information hiding algorithms are Least Significant Bit(LSB) and Bitplane Complexity Segmentation(BPCS) [1,2]. But the two algorithms are not perfect.…”

Section: Introductionmentioning

confidence: 99%

A Fragile Information Hiding Technique Based on Human Visual Gray Sensitivity

Bing

Wang

2010

AMR

View full text Add to dashboard Cite

Based on human visual gray sensitivity, a fragile large capacity spatial domain information hiding algorithm, and a new calculation formula of image peak signal-to-noise ratio were put forward. An adaptive embedding method was proposed, which had the minimum visual gray sensitivity when massive information were hidden into an original image. Experiments showed that this algorithm had massive amount of embedded information and excellent masking properties, and what’s more, once there is a bit tampered randomly, the watermarking image could not be recovered correctly. So it was suitable for the situation where the received information must be very strict reliably.

show abstract