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 roca
Search options not deleted
user 59507
ROCA is an acronym for "Return of the Coppersmith Attack" — a vulnerability in the RSALib cryptographic software library thought to be used in millions of smart cards and other devices.
2
votes
ROCA Implementation, Coppersmith Algorithm does not return roots
At the end of the function coppersmith_howgrave_univariate, you have
if gcd(modulus, result) >= modulus ^ beta:
You created $f$ as
$$
f(x) = x + (M'^{-1} \bmod N)(65537^{a'}\bmod M),
$$
so when yo …
- 21