update!
if so, the NEW Q will be:
what is the strongest encryption algorithm ? (no time limits)
note that the algorithm can Not make more letters than the input
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
http://en.wikipedia.org/wiki/One-time_pad
If your requirements are complete security and not increasing the length of the message at all, then it is possible to do this using a one-time-pad implementation.
Your key material needs to be:
If you are able to do these 4 things, then you can achieve maximum security without increasing your message length.
Your ability to implement this depends on your requirements. At the point you have done 1-4 above, you have not lessened the problem of key exchange (if indeed that is needed).
Read the linked article, and it will explain in good detail.