Is it possible to create an easy to use encryption/decryption method that will never be comprimised? In the comments of the question "Why programming languages don't provide simple encryption methods?" the following statement was made:


  A well thought out, tested and understood standard that has undergone
  extensive review by the crypto community has a much better [chance] of
  avoiding compromise than a system designed by a single engineer using
  a fairly low level library.


to me such a system would have the following requirements:


Encryption would require nothing more than a string of text to encrypt and an easily programmatic producible "key".
Decryption would require nothing more than an easily programmatic producible "key".
The result would not ever be able to be determined with out access to the key even given a reasonably huge finite (IE more than we can ever expect to have available) amount of computing power.
No method of attack would ever trivialize the determining the key or the source text used for the encryption.


My opinion is that the nature of encryption is that it is impossible for a standard like this to work given an infinite amount of computing power. We may be able to do this for the computing power of today but eventually given enough power it will be trivial to decrypt any scheme if we know how the scheme works and it only requires a single key. Is such a scheme possible?
If the key is:


generated with an unpredictable truly random uniform generator (not a pseudo-random generator);
as long as the data to encrypt;
used for only one message ever;


then this is the One-Time Pad model, and you can encrypt data by a simple bitwise XOR (no need for an explicit function, just XOR).

Otherwise, there is no solution which resists attackers with infinite computational abilities. Shannon's thesis is all about that.