905 reputation
69
bio website
location
age
visits member for 3 years
seen Apr 1 at 8:34

Jul
12
awarded  Yearling
Jun
3
awarded  Notable Question
Dec
20
revised Diffie-Hellman insecure on addition modulo $n$
added 24 characters in body
Dec
20
revised Diffie-Hellman insecure on addition modulo $n$
added 20 characters in body
Dec
20
answered Diffie-Hellman insecure on addition modulo $n$
Aug
24
awarded  Nice Answer
Jul
12
awarded  Yearling
May
5
awarded  Popular Question
Jan
10
comment How secure is the knapsack?
I am using the special properties of the knapsack (the sum). It is actually meant to be used in another protocol. In my case $X$ (the target sum) is defined by the user. We are free to choose $W$. However, as a first solution, I will be happy even if both $(W, X)$ are freely chosen, as this might be extended even when $X$ is fixed.
Jan
10
revised How secure is the knapsack?
edited body
Jan
10
revised How secure is the knapsack?
added 318 characters in body
Jan
10
comment How secure is the knapsack?
@Ilmari Karonen: Not really, but good point. In my use-case, we don't need the solution, just the problem to be hard. I have updated the question with this information.
Jan
9
revised How secure is the knapsack?
added 46 characters in body
Jan
9
revised How secure is the knapsack?
added 15 characters in body
Jan
9
asked How secure is the knapsack?
Oct
18
revised Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
deleted 2 characters in body
Jul
12
awarded  Yearling
Jun
13
awarded  Taxonomist
Oct
24
revised What is the general justification for the hardness of finding preimages for cryptographic hash functions?
added 43 characters in body
Oct
16
accepted Why has the RSA factoring challenge been withdrawn?