Ramifications of being able to factor large composite numbers
-2
$begingroup$
I think I found 2 methods of quickly factoring large composite numbers made from multiplying 2 large prime numbers. What are some possible ramifications?
prime-factorization
asked Jan 3 at 12:47
JamesJames
76
$endgroup$
|
show 5 more comments
-2
$begingroup$
I think I found 2 methods of quickly factoring large composite numbers made from multiplying 2 large prime numbers. What are some possible ramifications?
prime-factorization
asked Jan 3 at 12:47
JamesJames
76
$endgroup$
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58
|
show 5 more comments
-2
-2
-2
$begingroup$
I think I found 2 methods of quickly factoring large composite numbers made from multiplying 2 large prime numbers. What are some possible ramifications?
prime-factorization
asked Jan 3 at 12:47
JamesJames
76
$endgroup$
I think I found 2 methods of quickly factoring large composite numbers made from multiplying 2 large prime numbers. What are some possible ramifications?
prime-factorization
prime-factorization
asked Jan 3 at 12:47
JamesJames
76
asked Jan 3 at 12:47
JamesJames
76
asked Jan 3 at 12:47
JamesJames
76
asked Jan 3 at 12:47
JamesJames
76
asked Jan 3 at 12:47
JamesJames
76
76
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58
|
show 5 more comments
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58
|
show 5 more comments
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060530%2framifications-of-being-able-to-factor-large-composite-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060530%2framifications-of-being-able-to-factor-large-composite-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
The ramifications being able to quickly factor large numbers is that the RSA algorithm ceases to be a secure encryption method, and more or less all of internet security will collapse. But (no offense) I doubt very much that the methods you work are both correct and quick enough for that to happen.
$endgroup$
– 5xum
Jan 3 at 12:52
$begingroup$
@5xum Especially given that studying enough number theory to be able to develop any non-trivial way of factoring will inevitably lead to learning about RSA.
$endgroup$
– Tobias Kildetoft
Jan 3 at 12:55
$begingroup$
@Tobias Kildetoft I do know about RSA but I was wondering if there were any other ramifications
$endgroup$
– James
Jan 3 at 12:57
$begingroup$
@TobiasKildetoft That is exactly what I was about to write if anyone asked me why I don't believe the OP :)
$endgroup$
– 5xum
Jan 3 at 12:57
$begingroup$
@James I don't think any other ramification would come close to destroying internet security as we know it...
$endgroup$
– 5xum
Jan 3 at 12:58