|
Short answer, it is possible to, “hide data inside a text file without changing the fle size even by a single byte and without replacing/changing/distorting any of the readable/printable letters of the file”. But the characters would not be readable at that time the “hidden” data is in there. Of course you need a mask data stream to extract the “hidden” data from the real/actual (what ever you want to call it) data. The question here is why???  If you want to encrypt/hide the data then use a real encryption algorithm. It would be far more secure then simple hide and seek protocol.
|
|
|
|
|
|
No i am not using NTFS alternate file streams.
|
|
|
|
|
Text file contains only character codes.What if i can hide data inside the text file without distorting/changing/replacing a single readable character.
|
|
|
|
|
Pallab: Your algorithm is unique if it really does what you say. I have a fair amount of experience with algorithms in general, and data compression and encryption in particular, and I've never heard of an algorithm that can do what you say. I'm not saying it's impossible; I've seen some very clever algorithms that do amazing things.
You really shouldn't reveal the details until you get it patented. It potentially has value, and if you publicly disclose how it works you won't be able to patent it later. I don't know if you're in the US, but in the US you can get an inexpensive provisional patent that will give you a year to turn it into a more rigorous 20-year patent.
|
|
|
|
|
Mr.Balkany : Thankyou for ur message.Sir I am from Bangladesh and i am a novice in software development in compared to you and my knowledge is very limited.So i am knocking ur door to render me some help on this issue.Sir below i am mentioning the aspects of my technic:
1.The size of the carrier text file does not change even by a single byte after hiding the data.
2.Not a single readable/printable letter of the carrier text file is changed/replaced/distorted.
3.You will notice absolutely no change whatsoever as far as reading the file is concerned.
Considering the above points do u think that my technic is unique?
Sir,if my technic is unique then what should i do with it?Can you plse guide me?
As my knowledge is very limited,i am really confused by all the remarks i got till now.
modified on Friday, March 21, 2008 6:15 AM
|
|
|
|
|
Hey Pallab, have you the samples of text file and its twin with hidden information inside you promised yesterday?
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
Yes sir,I have my promise on my mind and i promise to give u the file.Sir just give me sometime.Plse bear with me.
|
|
|
|
|
I will wait for with trepidation.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
Sir,Learned man like you will for paper with trepidation from a man like me,I am really overwhelmed.Sir i will ask a little more than a week time from you.Cause before i give my proof to you i want be absolutely sure that my technic works in all possible scenario.By 30th March i will be able to give u the proof.Is that ok with you?
|
|
|
|
|
OK. I will wait with increased trepidation.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
|
|
|
|
|
Can you plse give me your emailid so that i can discuss some more with u.I want to keep our discussions secret.
|
|
|
|
|
Just post a message for me here with hidden text. 
|
|
|
|
|
LOL.
This is the funniest thread I have ever read.
Did anyone notice the hidden poem?
|
|
|
|
|
Pallab_GT wrote: .I mean hiding the data in a text file without changing the file size even by a single byte and you wont see a single replacement/change/distortion in any of the letters of the file.As far as reading the file is concerned...the file will remain 100% unchanged even after hiding the data in it.
Ok so lets break your claim into this:
1) hiding the data in a text file without changing the file size even by a single byte
2) you wont see a single replacement/change/distortion in any of the letters of the file
3) As far as reading the file is concerned...the file will remain 100% unchanged even after hiding the data in it.
No problem with 1).
I see problem in 2): "you wont see" and "letters of the file" and 3) "As far as reading the file is concerned...the file will remain 100% unchanged"
"Text files are sequences of readable characters such as letters, digits, punctuation, or whitespace; and control characters such as section boundaries, rendering instructions for different languages, line feeds and carriage returns. Embedded information such as font information, hyperlinks, or inline images do not appear in text files, though references to them can be included within (such as HTML elements or metadata)."
(http://en.wikipedia.org/wiki/Text_file[^])
If you replace letter with different letters that *looks* same in some font, file is far from unchanged. Sure, person looking at it in notepad or whotever might not notice, but as far as reading the file for text editor, that is a difference. Sorry but if this is your idea it's close to using white font on white background
[ My Blog] "Visual studio desperately needs some performance improvements. It is sometimes almost as slow as eclipse." - Rüdiger Klaehn "Real men use mspaint for writing code and notepad for designing graphics." - Anna-Jayne Metcalfe
|
|
|
|
|
dnh wrote: it's close to using white font on white background
awww... that doesn't work????!!!???? Next thing you know you will tell me the Easter Bunny and Santa Claus are trickery too! 
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
No Sir,thats not my idea.I am again claiming that "You wont see any change/replacement/distortion in any of the readable/printable characters in the carrier text file" after hiding the data and the the text file will remain 100% unchanged as far as reading the file is concerned.
|
|
|
|
|
The sneakest (well, not the sneakest - the sneakest way is to write a filesystem driver that modifies the information presented to the OS) way that I know of doing something like this is to use an alternate file/data stream.
This effectively hides data from the "naked eye", and its takes a little know-how to get at the streams.
Have a look here: http://www.heysoft.de/Frames/f_faq_ads_en.htm[^] for more information.
Peace!
-=- James Please rate this message - let me know if I helped or not!<hr></hr>If you think it costs a lot to do it right, just wait until you find out how much it costs to do it wrong!
Remember that Professional Driver on Closed Course does not mean your Dumb Ass on a Public Road!
See DeleteFXPFiles
|
|
|
|
|
Can linked list be sorted in O(n) time? If yes, how? Thanks in advance!
|
|
|
|
|
Yes it can, but you need a parallel-processing system with n processors to do it:
1. Traverse the linked list and put the ith data item in a register in the ith processor.
2. On even time steps, compare the number in each even-numbered processor with its next-highest odd processor. If the two processors' numbers are out of order, swap them.
3. On odd time steps, compare the number in each odd-numbered processor with its next-highest even processor. If the two processors' numbers are out of order, swap them.
Step 1 is O(n). Steps 2 and 3 will repeat a maximum of n-1 times before the list is sorted, so are therefore also O(n). Therefore the total running time of the algorithm is O(n).
|
|
|
|
|
Hi,
any algorithm can do it in zero time with a single processor with infinite speed.
That is O(1), or should I say O(0)?
No need for parallel processing whatsoever. 
Luc Pattyn [Forum Guidelines] [My Articles]
This month's tips:
- before you ask a question here, search CodeProject, then Google;
- the quality and detail of your question reflects on the effectiveness of the help you are likely to get;
- use PRE tags to preserve formatting when showing multi-line code snippets.
|
|
|
|
|
Not in a general way, no.
If you can map your objects uniquely to the natural numbers [0 .. n), then you can do it in O(n) with a storage complexity of S(n). Create an array the size of your list. Iterate through the list, and put each object in its corresponding slot in the array. Then iterate through the array, and rebuild your list.
This places a really bad constraint on your contained objects of course. But that's one price to pay for trying to do the impossible.  (It has been proven that you cannot come up with a general sorting algorithm faster than n log n)
--
Kein Mitleid Für Die Mehrheit
|
|
|
|
|
Hi,
I've an image processing problem that I would appreciate any suggestion on how to tackle (ideally in c#):
Problem: I have a series of still images of circular discs (think audio CDs) captured from a video camera. Every time a disc passes the camera a still image is captured. The discs images contain text and graphics, the content can be considered random. When the discs are captured by the camera they are in a random orientation. I’m looking for an algorithm that will automatically rotate the image so that it is ‘aligned’ i.e. the majority of text (if any) is horizontal.
Any suggestions of what to try?
Thanks
|
|
|
|
|
Are the discs some solid color otherwise? Perhaps you could try drawing parallel lines through the image at ~15 degree increments from 0 to 165 degrees. Then compare the number of color changes along those lines. The fewer color changes, the more aligned your image. You could also try finding the center of the disc, then draw circles beginning from the outside. Once you hit something of a different color on opposite sides of the disk, you can compute the angle between them and rotate according to that. You may also want to try bluring the image to begin with, to make any lettering make a stripe of some color on the disk. Perhaps another idea is to pick a common rotationally asymmetric letter, such as 'e' since you know the language on the CD's, and try to find it on the disk. Compare the rotation of the letter to what you expect, and rotate the disk accordingly. These are just some of the approaches that I thought of sitting here, but I have never personally done much image processing. Good luck,
Sounds like somebody's got a case of the Mondays
-Jeff
|
|
|
|
|
Using Audio CDs as an example the discs generally contain some text and some graphics... But the content is virtually random. I think one approach would be to separate the text from the image, work out the orientation of each string on the disc, then rotate the disc image so that the majority of the text is correctly aligned…
So maybe the question is: how do you identify text within an image?
Thanks for your thoughts…
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
