| Rsa Problem |
Article Index for Rsa |
Website Links For Problem |
Information AboutRsa Problem |
| CATEGORIES ABOUT RSA PROBLEM | |
| asymmetric-key cryptosystems | |
|
More specifically, the RSA problem is to find Integer ''P'' such that ''P''''e'' ≡ ''C'' (mod ''N''), given integers ''N'', ''e'' and ''C'' such that ''N'' is the product of two large Primes , 2 < ''e'' < ''N'' is Coprime to φ(''N''), and 0 <= ''C'' < ''N''. ''C'' is chosen randomly within that range; to specify the problem with complete precision, one must also specify how ''N'' and ''e'' are generated, which will depend on the precise means of RSA random keypair generation in use. s) is as hard as factoring ''N''. The goal of a secure RSA Padding Scheme is to make breaking the resulting cryptosystem Provably as hard as solving the RSA problem. SEE ALSO REFERENCES
|
|
|