RSA Algorithm - Simple English Wikipedia, The Free Encyclopedia
Có thể bạn quan tâm
| The English used in this article or section may not be easy for everybody to understand. You can help Wikipedia by reading Wikipedia:How to write Simple English pages, then simplifying the article. |
RSA (Rivest–Shamir–Adleman) stops people from understanding messages they are not allowed to read. A message only some people can understand is called an encrypted message. Any message can become an encrypted message. An encrypted message can be given to anyone because they will not understand what it says. To understand the encrypted message a person must first get the original message back. This is called decryption.
RSA uses two special numbers. One number is called the public key and allows anyone to write an encrypted message. The second number is called a private key and allows understanding the encrypted message (decryption). Both numbers belong together. They are a pair. RSA gives everyone a different pair of numbers to use.
Reading and writing encrypted messages is called cryptography. There are different kinds of cryptography. Cryptography that uses two numbers (keys), like RSA, is called asymmetric cryptography and public key cryptography.
Usually only reading encrypted messages is important. Anyone may write them. This is why the public key can be given to everyone and is called public. The private key needs to be kept secret.
RSA uses math that is easy to do but hard to undo. Someone who does not have the private key must do a lot of work to find it. Reading an encrypted message with the private key is easy.
The math takes a large number and finds numbers that can be multiplied to equal the large number. The smaller numbers are called factors. If a number has no factors it is called a prime number otherwise it is called a composite number. Finding the smallest factors for a large number is called prime factorization.
Từ khóa » Phi Rsa
-
Public Key - Why Is It Important That Phi(n) Is Kept A Secret, In RSA?
-
RSA Algorithm - Lei Mao's Log Book
-
RSA By Example - Gists · GitHub
-
[PDF] Lecture Notes On RSA And The Totient Function
-
In RSA Encryption Algorithm, Can We Find P And Q, If We Have Totient ...
-
RSA Encryption: Step 4 (video) - Cryptography - Khan Academy
-
Finding RSA Phi Value : R/crypto - Reddit
-
RSA Algorithm - Di-.au
-
In RSA, What Does (e Mod Phi(N)) Signify And Why Is Its Multiplicative ...
-
Attacking RSA By Factoring N Given Phi(n) - YouTube
-
RSA Risks: Selecting PHI Which Shares A Factor With E - YouTube
-
Cryptography - RSA Method
-
RSA Calculator
-
[PDF] Public-Key Cryptography RSA Attacks Against RSA