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 diffie-hellman
Search options not deleted
user 80279
The Diffie–Hellman key agreement is an anonymous, non-authenticated key-agreement protocol.
0
votes
2
answers
263
views
Diffie-Hellman should size of group be a prime?
I have found some contradicting answers regarding finding a safe prime.
When p is a "safe prime", this means that $(p−1)/2$ is also prime. We then define $q=(p−1)2$. In that situation, the order …
- 146k
0
votes
0
answers
47
views
Secret keys in Diffie-Hellman
I assume 1 atleast is excluded from the set of possible secret keys, since you can compromise the key just by looking at the equation if it is 1 $g^1 \mod p \equiv g$. In case g is less than $p$ obvio …
- 139
0
votes
1
answer
721
views
Diffie-Hellman what is the subgroup
I am trying to understand the safety precautions regarding the variables used in Diffie-Hellman and I was refered to this post answer Does the generator size matter in Diffie-Hellman?.
In more det …
- 151k
-1
votes
1
answer
55
views
Diffie-Hellmann why bigger primes prefered over bigger pseudorandom secrets?
So I have build an application which purpose is to demonstrate Diffie-Hellman. I don't fully understand some of the arguments for the sizes of the numbers used in the algorithm.
It seems like there is …
- 146k
2
votes
1
answer
6k
views
Cracking diffie-hellman
I want am making an application, demonstrating an attack on a weakly performed diffie-hellman. I need to implement an algorithm that can use the shared variables in order to compute the key. Searching …
1
vote
1
answer
51
views
Diffie-Hellman server/client generated secret size
So I have implemented a client and a server performing Diffie-Hellmann, however sometimes the symmetric key is not valid?
Example:
Prime: 23
Primitive root: 5
client secret: 14
server secret: …
- 46.4k