# RSA RSA is a cryptosystem first proposed in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman, and is one of the most famous public-key cryptosystems. It is used for 2 things: * Encrypting a message with a public key. This can then be decrypted with a private key. * Signing a message digitally allows it to be verified and makes sure it hasn't been tampered with. The core of RSA is that there are things that are very easy to do one way, and very very challenging to do the other way. The example that RSA uses is multiplying prime numbers together. Take the two prime numbers 97 and 83. We can multiply these two numbers very easily using a calculator or pen and paper, giving 8051. However, if I were to give you the number 2059, and asked you to find the two primes which multiply to give it, it is much harder to do this and takes a lot longer to do so. This is called a 'trapdoor function' and such functions are used all over cryptography. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://the-winrars.gitbook.io/references/crypto/rsa.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.