Which Is Unconditionally Secure Algorithm?
Unconditional Security – a Cryptographic System Is Unconditionally Secure If It Is Secure Even in the Case Where an Adversary Has Unlimited Resources for...
Unconditional security – a cryptographic system is unconditionally secure if it is secure even in the case where an adversary has unlimited resources for solving a problem e.g. breaking a cipher. An adversary has not sufficient information for doing that because is unable to gain any meaningful data from a cipher text.
Is AES unconditionally secure?
AES is the current encryption standard (Daemen and Rijmen, 2002), but it is also reported to be vulnerable to algebraic attacks (Courtois and Pieprzyk, 2002). Therefore the unconditional security (theoretical security, perfect secrecy and perfect security), of cryptosystem will become more and more important.
What is an unconditionally secure system?
The definition of an unconditionally secure cryptosystem states that the cryptosystem cannot be broken even with infinitely computational ressources and time. However, since most books define the keyspace K to be finite, then with infinite time any computational device can perform an exhaustive keysearch.