Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re: Unbreakable crypto

by rob_au (Abbot)
on May 19, 2004 at 07:42 UTC ( #354539=note: print w/ replies, xml ) Need Help??


in reply to Unbreakable crypto

Whilst this obfuscation did not produce the described output on my system (Mac OS X 10.3.3 with standard shipping build of perl 5.8.1RC3), I would note that bit-shift encryption, whilst often a component of other ciphers, by itself is not unbreakable. This is particularly true in this implementation as the supplied code represents an symmetric cryptographic implementation necessitating the transfer of keys for decryption.

 

perl -le "print unpack'N', pack'B32', '00000000000000000000001011011011'"


Comment on Re: Unbreakable crypto
Re: Re: Unbreakable crypto
by thor (Priest) on May 19, 2004 at 12:09 UTC
    One time pads are the only information theoretically secure cipher. Of course, the devil's in the details. The key has to be truly random. There is the issue of key exchange. But, once you meet these requirements, there is no way to break a one time pad. All possible decryptions with the same length as the message are equally likely, so how do you know that you know that a given 6-letter string decrypts to "rob_au" vs "chester"?

    thor

      Because "chester" is 7 letters?

      The PerlMonk tr/// Advocate
        If you want to be a stickler for the "details", I suppose you're right. But what you didn't see was there was a NUL at the end of "rob_au", thus making it seven characters. ;)

        thor

      All possible decryptions with the same length as the message are equally likely

      This is one property of OTPs that I think is often overlooked for practical applications. This could be used for plausible deniability reasons. For instance, say you took the source code to a DeCSS program and a letter to your Grandma, which are both exactly the same length. You then generate a random string of characters, also of the same length. There exist two seperate OTP keys for that character stream, one of which will decrypt the stream into the DeCSS source and the other into the letter. Generating these keys is as simple as XOR'ing the stream against the document. If you get caught, you can give the authorities the key for the letter, and they thus have no evidiance. You can then walk away and give your freinds the key for the source code.

      ----
      send money to your kernel via the boot loader.. This and more wisdom available from Markov Hardburn.

        If you get caught, you can give the authorities the key for the letter, and they thus have no evidiance.
        Until they knock on your door and politely ask you to hand over all your computer equipment.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://354539]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (7)
As of 2014-09-22 10:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (188 votes), past polls