Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 23901

An asymmetric (e.g. public-key) cryptosystem, based on modular exponentiation with big exponents and modulus. RSA can be used both for signature and encryption with proper paddings.

2 votes
0 answers
44 views

Are there UFDs where the factorization problem is difficult but finding irreducibles is cheap?

It could provide an alternative ring to do RSA/Rabin over. A suggestion is the polynomial ring over $\Bbb Z_{pq}$ where $p$ and $q$ are prime. …
wlad's user avatar
  • 1,249
12 votes
1 answer
1k views

If RSA is only used to encrypt symmetric keys which are random, what's wrong with textbook RSA?

But if RSA is only used to encrypt symmetric keys, what's wrong with using only textbook RSA because random keys are very unlikely to repeat? …
wlad's user avatar
  • 1,249