9 reputation
2
bio website
location
age
visits member for 1 year, 11 months
seen Nov 19 '12 at 3:41

Oct
30
comment “Padless” One-time-Pad encryption
OK, here is the code, just in case anyone is curious :) pastebin.com/2zpdHCzd
Oct
30
comment “Padless” One-time-Pad encryption
After a second thought it seems you might be right :)
Oct
30
comment “Padless” One-time-Pad encryption
<code></code> does not work, I would insert a code sample.
Oct
30
comment “Padless” One-time-Pad encryption
OMG, this got all corrupted, how do I paste a code snippet properly?
Oct
30
comment “Padless” One-time-Pad encryption
I did it in Perl, the basic idea is this:i=i=filesize-1;while(i>=0) {i>=0) { iPos=int(i∗sin(eval(i * sin(eval(sEncFunc))); sKeyFragment=substrsKeyFragment = substr sDataFromFileTemp, iPos,1,′′;iPos, 1, ''; sEncryptionKey .= sKeyFragment;#pridaj do kluca# print OUTFILETEMP "sKeyFragment;#pridaj do kluca# print OUTFILETEMP "sDataFromFileTemp\tsKeyFragment\tsKeyFragment\tiPos\n"; $i--;}
Oct
30
comment “Padless” One-time-Pad encryption
Any combination of mathematical functions would work, like sinus, log, etc. The user would just enter some formula for every message/file to be encrypted using an OTP which would be buried inside the file using this one-time function. The final file would be double size of the original since it would include the OTP, too (with the same size as the encrypted content). Encryption would be standard XOR, as used in standard OTP.
Oct
30
comment “Padless” One-time-Pad encryption
The perfectly random OTP would be buried in the message, the algorithm to bury it in there would change with every message (the user would input it) and as such would be much shorter that the OTP (which will be exactly same size as the message) so much easier to transfer securely (one could just tell someone else and he would just remember the function in his/her memory)
Oct
29
comment “Padless” One-time-Pad encryption
Is it really possible to separate the truly random pad from the encrypted content by some cryptanalytic technique? I can not imagine how could this work in case the interleaving function is fairly complicated, or even if it is simple since the text is already encrypted by truly random pad and the pad is random, too. Interleaving them together further increases the randomness of the whole data.
Oct
29
comment “Padless” One-time-Pad encryption
The "secret algorithm" to interleave the pad with the ciphertext would be entered by the user (e.g. 25*$i*sin($i)/124) and would serve as the only password in this case. Let's forget about the computing of the pad from the message itself, and suppose it would come from a real RNG. Would this be secure enough (i.e. interleaving the pad using a secret function withing the source previously encrypted with the same function)? How could someone guess what is the encrypted content and what is the pad then?