Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^3: Encryption in Perl?

by CombatSquirrel (Hermit)
on Jul 19, 2004 at 19:09 UTC ( [id://375655]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Encryption in Perl?
in thread Encryption in Perl?

On the other hand the one-time pad, which is a Vignère ('simple XOR') variant with key length equal to or greater than the plain text length, is the only possible encryption algorithm with perfect secrecy, as was proven by Shannon.
Most other applications of the Vignère cipher (I just hesitate to say 'all') are quite easy to break, which everyone who ever attempted to break it will have found out.
The point is that "encryption/decryption" is not enough information to decide which algorithm to use. Even ROT13 can be permissible when the issue is not reasonable secrecy but the fear of revealing data to someone who does not want to know it.
And here we are. My advice to the OP: Unless you only meant to find modules and already read a couple of books on cryptology and cryptanalysis, better do it now. It is not neccessary, but in my eyes it'll help you understand your problem better. References: Gaines, Schneier, etc., pp.
Hope this helped.
CombatSquirrel.

Entropy is the tendency of everything going to hell.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (2)
As of 2024-04-20 03:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found