![]() This is known as the key distribution problem. This means that if Alice and Bob want to communicate using private-key encryption, they must find a way to establish the secret key over a secure channel first. In a symmetric system, the same secret key is used for both encryption and decryption.įigure 1: Principle of symmetric-key encryption ![]() While many people believe RSA to be the first public-key encryption, British mathematician Clifford Cocks invented an algorithm equivalent to RSA earlier in 1973, but this remained classified until 1997.Īsymmetric (public-key) cryptography relies heavily on number theoretic functions, and it is quite different from symmetric algorithms such as DES or AES. You may read the original RSA paper here. It was designed in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman (hence the name). RSA is one of the first public-key cryptosystems, whose security relies on the conjectured intractability of the factoring problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |