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 factoring
Search options answers only
not deleted
user 873
11
votes
Accepted
P with integer factorization oracle
I don't have an answer to you question, but I know that a similar notion has very recently been studied, under the name of "angel-based security."
The first paper studying this concept is Prabhakaran …
- 16.6k
9
votes
Consequences of Factoring being in P?
RSA is one of the most important encryption/signature schemes which breaks if FACTORING is in P. However, there are many more. …
- 16.6k
10
votes
Adding integers represented by their factorization is as hard as factoring? Reference request
I'm not aware of a reference, but I think I came up with a proof:
Assume you have an oracle $\mathcal{O}$ which, on input two factored numbers
$x = \prod_{i=1}^n p_i^{\alpha_i}$
and
$y = \prod_{i= …
- 16.6k
5
votes
Adding integers represented by their factorization is as hard as factoring? Reference request
The answer below is based on the discussions here: https://math.stackexchange.com/questions/54580/factoring-some-integer-in-the-given-interval. … In this answer, I will provide a deterministic polynimial-time Karp reduction from factoring to factoring the sum of two integers represented by their factorizations. …
- 16.6k