Show Bid Request text-based information hiding Bid Request Id: 29504 Bookmark in my 'To Do' list Posted by: IAN Liong (1 ratings) (Software buyer rating 10) Non-action Ratio: Very Good - 0.00% Buyer Security Verifications: Unverified Approved on: Oct 1, 2002 10:44:53 PM EDT Bidding Closes: Oct 15, 2002 11:15:03 PM EDT Viewed (by coders): 535 times Deadline: 10/31/2002 TIME EXPIRED Phase: 100% of work completed and accepted. Coder has been paid. Max Accepted Bid: Bidding is closed Project Type: Small Business Project: $100 (USD) + Bidding Type: Open Auction Categories: Language Specific, C++ / C, Java, Visual Basic, Security Enter chat room for this bid request (0 active users at Sep 29, 2003 3:36:50 AM EDT) Description: Need a system that able to hide a msg into another msg. it is also call as text-based steganography. The main idea is to change the secret msg into binary, then according to the binary code, it ll replace the synonym word for the plain msg. Step: Harmless msg= msg Secret msg= secret 1.secret is compressed using dictionary compression method. eg. ing=<13>, love=<14> 2.compressed secret is converted to binary code 3.a dictionary with many synonym of various word 4.replace the word according to the binary code. 5. reverse all the step to get back the secret. eg. secret msg = playing compressed secret = play13 or play<13> binary code = 11110010110101011010(it may convert to based on 4) in the dictionary: 0=**** 1=**** 2=**** 3=**** so it ll replace the synonym word according to the secret msg. and for the reverse step is to get back the secret msg. source code needed. interface needed. visual c++ or java. Deliverables: 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. Platform: windows 98, 2000 visual c++ or java Must be 100% finished and received by buyer on: Oct 31, 2002 EDT Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date. Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements. We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation. If you notice a violation please help out the site and report it. Thanks for your help.   Bidding/Comments: All monetary amounts on the site are in United States dollars. Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. See all rejected bids (and all comments) Name   Bid Amount    Date   Coder Rating   anUni Tech. (24 ratings) in dehradun, uttranchal India Bid id: 330,663   $200 (USD) Oct 2, 2002 9:06:08 AM EDT  10 (Excellent)     Hi, I will summarise what I understood and how I will do it. My scheme will allow different count of synonymn for each word i.e word may have 2,4,8,16...synonyms Ex. Procedure: synonymn count 2 4 2 sentence: word1 word2 word3 Now secret will be converted into binary -> e.g 1101 first word has two synonymn = 1 bit and we have to put 1 there so put synonymn[1] second word has 4 synonymn = 2 bit so next 1 & 0 can be put there by selecting (10 = 3) synonymn[3] last 1 can be put in third word by selcting synonymn[1] and this can easily be reversed to get secret from msg! I will do it in VC++ rgds Anurag           There are 8 private replies to/from anUni Tech.. Click here to view them.