On Fri November 7 2008, Chris Cheung wrote:
> Hi all,
>
> my question may not be directly related to OpenSSL, but I don't know
> where else better to seek for answer, so...
>


It is a general question -

Give it a bit of thought, the answer should be obvious -

If the encryption is "perfect" then it should be impossible to distingush
from purely random bits.
If there is any pattern to it, then it isn't "perfect".
If there is not any pattern to it, how can you match it up with a method?

Of course, nothing is "perfect", but the field of study is such that
many people make it their life's work to study it.

I.E: small question, big answer.

A different question, more limited answer -

The protocol used will always have some sort of "agreement" between sender
and receiver - often in the form of descriptive headers.
But that is a "protocol" or "practice" thing, not an "encryption" thing.

You can also ask google about: cryptography
that will give you about 7 million hits to read about the details.

Mike

> I'm curious to know, given a number of cipher texts, how hard it is to
> know, if at all possible, what algorithm was used to generate that?
>
> Chris
> __________________________________________________ ____________________
> OpenSSL Project http://www.openssl.org
> User Support Mailing List openssl-users@openssl.org
> Automated List Manager majordomo@openssl.org
>
>



__________________________________________________ ____________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager majordomo@openssl.org