flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
revolution 24 Oct 2010, 03:32
Tyler: I doubt there are any encryption experts on this forum, and even if there were they would not take to time to analyse your scheme because this problem (deniable encryption) has already been examined and the current best solutions from the current best cryptographers are already published and used in various freely available programs.
If you are really serious about encrypting something where exposure could ruin your life then I would strongly suggest that you don't go and invent your own scheme to do it. Since there is so much at stake (your future freedom) then it is wise to use methods and procedures that expert cryptographers have designed and tested. Do you really feel comfortable with entrusting your future freedom to an untried and unproven scheme of your own devising? So many people in the past have invented their own special encryption schemes thinking that is was wonderful and whatnot, but then later discover to their horror that methods to break it are trivial and simple to apply. |
|||
![]() |
|
Tyler 24 Oct 2010, 03:52
I have nothing worth encrypting, so I'm okay, for now;this is just a thought experiment, that I may materialise into code if no unfixable holes are pointed out. The bit about it being risky can be countered by the fact that it builds on other, already proven, methods of encryption. The best part is that it can contain as many files as you want, although the user must use common sense. Saying a 100GB encrypted file just contains one decoy video would never work, obviously. A possible solution to the size problem would be to allow the user to enter the size of the encrypted file(which would cause an error to be raised if it is too small). This is good for 2 reasons. 1) The bigger the encrypted files, the more meaningless bloat there is. 2) The extra size of, say, a video, is easily explainable by saying you told the program to make a huge file so as to hide the data in it.
BTW, it's completely plausible that you would use this program to encrypt a single file, which would eliminate the possibility of guilt by association. Meaning that they can't say that you're using an encryption algo that has to contain many files, and that you aren't revealing them all. Did you read it? If it's so easy to break, what hole did you find? |
|||
![]() |
|
revolution 24 Oct 2010, 04:18
Tyler: Just building upon and already proven scheme does not give you automatic proof that your new scheme also is secure. Really, this is a known problem with encryption, you can't simply take AES do some manipulation and expect it to always still be secure. There are so many pitfalls and subtle things that can expose details. Certain patterns might be present that reveal something.
Plus, your challenge here for us to point out mistakes is useless to you. 1) No one here is an expert (not that they have admitted anyhow). 2) Even if someone does spot something they might not tell you. 3) Even if someone does tell you of a problem, there can still be more problems. 4) Even if told a problem and you "fix" it, maybe the "fix" creates another problem. 5) Even if everyone here is perfectly honest and points out everything they see and you fix all of those things and the fixes are good. You still won't know if there are more problems. It could be that a real expert comes along later and says "Hey, there is an obvious error here. Wow were you really using that scheme? Ugh!". Basically you will never now if your scheme is good or not. Without proper exposure and peer review and many years of study and examining there is absolutely no way anyone can say your algo is good enough. Here is my suggestion: Just use TrueCrypt and make sure you follow all the rules and procedures for using the deniable encryption mode. And if you really have nothing to encrypt then, well, I guess it doesn't matter what you decide, since you won't be using it anyway. ![]() And, no, I didn't even read you scheme. I've seen so many schemes like this all over the Internet that I don't have time to analyse them anymore. Most of them have far too many problems to even try to fix them. Not that I am saying your scheme is bad, I don't know, it might be perfect, but it is impossible to know either way. |
|||
![]() |
|
bitRAKE 24 Oct 2010, 04:31
Can you provide the algorithm in outline form - I have difficulty following your prose? Are you implying the random buffer is a type of OTP? Is there some kind of mixing between files?
Here is my method. ![]() |
|||
![]() |
|
Tyler 24 Oct 2010, 05:21
bitRAKE wrote: Can you provide the algorithm in outline form - I have difficulty following your prose? Are you implying the random buffer is a type of OTP? Is there some kind of mixing between files? Code: get a list of files and respective passwords get size of output encrypted file get buffer the size of the output file fill buffer with prns encrypt using prn as key all space in buffer considered "free" allocate space for metadata(lists of offsets within the file which will contain blocks of data) the offset of metadata within the buffer is determined by a hash of the password for it's respective file allocate space for blocks of data using prns to determine their offset fill lists with offsets determined above encrypt each list with the password of it's respective password encrypt file with it's respective password put encrypted lists and data blocks from encrypted files into the buffer at allocated spaces output buffer Is that any better than my "prose"? ![]() |
|||
![]() |
|
Tyler 24 Oct 2010, 05:27
Basically, it's an encrypted file system within an encrypted file, that uses different encrypted metadata depending on the password you use to access it.
|
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2025, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.