As first publicly accessible, from the NSA for the classification "top secret" approved cipher, the Advanced Encryption Standard (AES) is one of the most frequently used and most secure encryption algorithms available today. Its story of success started 1997, when the National Institute of Standards and Technology NIST announced the search for a successor to the aging encryption standard DES. An algorithm named "Rijndael", developed by the Belgian cryptographists Daemen and Rijmen, excelled in security as well as in performance and flexibility. It came out on top of several competitors, and was officially announced as the new encryption standard AES in 2001. The algorithm is based on several substitutions, permutations and linear transformations, each executed on data blocks of 16 byte – therefore the term blockcipher. Those operations are repeated several times, called “rounds”. During each round, a unique roundkey is calculated out of the encryption key, and incorporated in the calculations. Based on this block structure of AES, the change of a single bit either in the key, or in the plaintext block results in a completely different ciphertext block – a clear advantage over traditional stream ciphers. The difference between AES-128, AES-192 and AES-256 finally is the length of the key: 128, 192 or 256 bit – all drastic improvements compared to the 56 bit key of DES. By way of illustration: Cracking a 128 bit AES key with a state-of-the-art supercomputer would take longer than the presumed age of the universe. And Boxcryptor even uses 256 bit keys! As of today, no practicable attack against AES exists. Therefore, AES remains the preferred encryption standard for governments, banks and high security systems around the world.
More Information can be found here:
RSA is one of the most successful, asymmetric encryption systems today. Originally discovered 1973 by the British intelligence agency GCHQ, it received the classification “top secret”. Its civil rediscovery is owned to the cryptologists Rivest, Shamir and Adleman, who discovered it during an attempt to break another cryptographic problem. As opposed to traditional, symmetric encryption systems, RSA works with two different keys: A “public” key, and a “private” one. Both work complementary to each other, a message encrypted with one of them can only be decrypted by its counterpart. Since the private key can’t be calculated from the public key, the latter is generally made available to the public. Those properties enable asymmetric cryptosystems to be used in a wide array of functions, such as digital signatures. In the process of signing a document, a fingerprint, encrypted with RSA, is appended to the file, and enables the receiver to verify both the sender and the integrity of the document. The security of RSA itself is mainly based on the mathematical problem of integer factorization. A message that is about to be encrypted is treated as one large number. When encrypting the message, it is raised to the power of the key, and divided with remainder by a fixed product of two primes. By repeating the process with the other key, the plaintext can be retrieved back. The best, currently known method to break the encryption requires factorizing the product used in the division. Currently, it is not possible to calculate these factors for numbers greater than 768 bits. None the less, modern cryptosystems use a minimum key length of 3072 bits.