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 public-key
Search options not deleted
user 112465
An asymmetric cipher is an encryption scheme using a pair of keys, one to encrypt and a second to decrypt a message. This way the encrypting key need not be kept secret to ensure a private communication. Similarly in public key authentication, the verification key can be public and the signing key private.
1
vote
1
answer
85
views
Is gcd(e,p−1)=1=gcd(e,q−1) similar to gcd(e,phi(n))=1?
I wonder, is $\gcd(e,p−1)=1=\gcd(e,q−1)$ similar to $\gcd(e,\phi(n))=1$ ??
- 11
0
votes
0
answers
60
views
In RSA Encryption, Can the public exponent e > m (modulus) ? and can we choose any public ke... [duplicate]
In RSA ,the encryption, Can we choose the public exponent (e) greater than m (modulus) or e > φ(n) ?
I wonder about choosing public key exponents (e) because the most information on the internet or ar …
- 11
0
votes
0
answers
54
views
In RSA Encryption, Can I choose the public exponent e > m (modulus) ? or e > φ(n)? [duplicate]
In RSA ,the encryption, Can we choose the public exponent (e) greater than m (modulus) or e > φ(n) ? I wonder about choosing public key exponents (e) because the most information on the internet or ar …
- 11