Is it possible to create an easy to use encryption/decryption method that will never be comprimised?
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.