Least Significant Bit Algorithm…
How a text can be hidden in a audio wave…….Well I got the answer from an algorithm ,The LSB(Least Significant Bit)…. 🙂 I hav to make use of dis algorithm in my codings……The file below has got the details abt the algorithm…….
Life Journey... 
to know detail about LSB algorithm
i need the steps for the working of least significant bit algorithm
least significant bit theory
how LSB algorithm works
If any one knows about LSB please send me.
My mail id:shanmuk_1982@yahoo.co.in.
I need description of LSB algorithm.
hi,
i want to know the details of lsb algorithm.can u plz tell where can i find them.
In computing, the least significant bit (lsb) is the bit position in a binary integer giving the units value, that is, determining whether the number is even or odd. The lsb is sometimes referred to as the right-most bit, due to the convention in positional notation of writing less significant digits further to the right. It is analogous to the least significant digit of a decimal integer, which is the digit in the ones (right-most) position.[1]
In referencing specific bits within a binary number, it is common to assign each bit a bit number, ranging from zero upwards to one less than the number of bits in the number. However, the order used for this assignment may be in either direction (see Endianness). Both orderings are used (in different contexts), which is why “lsb” is often used to designate the units bit instead of a bit number, which has the potential for confusion.
By extension, the least significant bits (plural) are the bits of the number closest to, and including, the lsb.
The least significant bits have the useful property of changing rapidly if the number changes even slightly. For example, if 1 (binary 00000001) is added to 3 (binary 00000011), the result will be 4 (binary 00000100) and three of the least significant bits will change (011 to 100). By contrast, the three most significant bits stay unchanged (000 to 000).
Least significant bits are frequently employed in pseudorandom number generators, hash functions and checksums.
LSB, in all capitals, can also stand for “Least Significant Byte”. The meaning is parallel to the above: it is the byte (or octet) in that position of a multi-byte number which has the least potential value.
luv u pinky
bye
tc
can any one explain me how lsb algorithm works with images?
detail about stegnography
hi, can u explain how lsb algorithm works in video?
hai can u explain how lsb works in video…plz…….
hi….
i want to no the working of lsb algorithm on extracting side in steganography…. if anybody know the answer pls mail to dipika_vinaykiya@yahoo.com
The least significant bits have the useful property of changing rapidly if the number changes even slightly. For example, if 1 (binary 00000001) is added to 3 (binary 00000011), the result will be 4 (binary 00000100) and three of the least significant bits will change (011 to 100). By contrast, the three most significant bits stay unchanged (000 to 000).
Least significant bits are frequently employed in pseudorandom number generators, hash functions and checksums.
LSB, in all capitals, can also stand for “Least Significant Byte”. The meaning is parallel to the above: it is the byte (or octet) in that position of a multi-byte number which has the least potential value
in steganography
a message might be hidden or encrpty with in in an image by changing least significant bit to be the message bits then the image can be transsmitted through network.lsb based steganography is perhaps the most simple and stright forward approach . in this will only affect each pixel by +\-1, if at all ,it is gennrally assumed with good reson that deradation caused by this embedding process would perceptully transaprent. hence there are anumber of lsb based steganography techniques in the passive warden model as it difficult to differentate cover-image from stegoimages ,given the small changes that have been made.
The least significant bits have the useful property of changing rapidly if the number changes even slightly. For example, if 1 (binary 00000001) is added to 3 (binary 00000011), the result will be 4 (binary 00000100) and three of the least significant bits will change (011 to 100). By contrast, the three most significant bits stay unchanged (000 to 000).
Least significant bits are frequently employed in pseudorandom number generators, hash functions and checksums.
LSB, in all capitals, can also stand for “Least Significant Byte”. The meaning is parallel to the above: it is the byte (or octet) in that position of a multi-byte number which has the least potential value
in steganography
a message might be hidden or encrpty with in in an image by changing least significant bit to be the message bits then the image can be transsmitted through network.lsb based steganography is perhaps the most simple and stright forward approach . in this will only affect each pixel by +\-1, if at all ,it is gennrally assumed with good reson that deradation caused by this embedding process would perceptully transaprent. hence there are anumber of lsb based steganography techniques in the passive warden model as it difficult to differentate cover-image from stegoimages ,given the small changes that have been made.
hi can any body mail be the general structure of lsb algorithm
for images pls
plz tell me the complexity of LSB algorithm for audio steganography….its urgent…
hi can anybody mail me the general structure of lsb algorithm for images or only the lsb algorithm.
anybody has LSB CODE for watermarking
ple detail about lsb algorithm
hinding information
tell me the snr,pnsr,mse value of the lsb steganography algorithm
please tell me how lsb technique work to hide the image within the image..
i m new to this topic,,,i have to do it in my thesis ,,,,,i need it,,,please tell me,,if any one know any link about it then also tell me,,,,please
how to work lsb technique in steganography ?
Anybody who needs help in Steganography and watermarking may contact me. I will not give you my algo as it will be published in March by IEEE but I can explain the LSB concept and algo. I also have code but all that would be available after my publication.:)
mam priyadarshi pal..i wan to knw ur email id through which i can contact you and get the information on steganography
it would be great if you could help me pls..
priyadarshi.pal@gmail.com. Oh by the way its a sir not a man..:)
can u give me the brief explaination for SLSB (selective least significant bit) algorithm
Back in about 1968 when I worked for BTL I was issued a patent in 19 countries related to this issue. The patent was for a hardware configuration to accomplish the task (until G. Benson received his software patent a couple of years later, software algorithms couldn’t be patented.) But the basic concept applies from the hardware solution to a software solution. In general, if you have a binary number such as 001101111 and you’re looking for the bit position of the least significant zero, you just add 1 to the number (it becomes 001110000) and then do a Boolean comparison of the two using the function that looks for a 0 in the original number and a 1 in the same bit position in the resultant number. It never fails. If you’re looking for the position of the least significant 1, simply do the proper complement before adding the 1.
Hey, great page but there is a problem whereby on occassion I am redirected to the root page whenever I look at different pages within your website.