Search Results
| 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 rsa
Search options not deleted
user 53571
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.
1
vote
0
answers
127
views
RSA Accumulator construction - how to pick the initial state?
I read about RSA Accumulators and I wish to construct one using a programming language of my choice. For selecting modulus N, I see various implementations picking the RSA-2048 number. … Also, as the article suggests:
"The initial state of the RSA Accumulator is the generator sampled
from the group of unknown order $g$". …
- 334