Decrypting Multi-Prime RSA with e, N, and factors of N givenWhat makes RSA secure by using prime...
How could a steampunk zeppelin navigate space?
If I did not sign promotion bonus document, my career would be over. Is this duress?
Why do adjectives come before nouns in English?
I am often given, occasionally stolen, rarely sold, and never borrowed
Do businesses save their customers' credit card information until the payment is finalized?
Why would oxygen be stored as a super critical fluid?
What could possibly power an Alcubierre drive?
How do I get my boyfriend to remove pictures of his ex girlfriend hanging in his apartment?
How to snip same part of screen as last time?
I need an automatic way of making a lot of folders
My Guitar came with both metal and nylon strings, what replacement strings should I buy?
How to respond to "Why didn't you do a postdoc after your PhD?"
Is it a bad idea to get a PhD?
Hero battle game
What Apple System Monitor/Integer BASIC ROM features were removed in the Applesoft II/Autostart ROM?
Trade a bishop in the opening
Why is technology bad for children?
Is aerodynamics study compulsory for building a plane?
Why should be velocity through the nozzle throat be sonic?
Remove last letter 4 times, get a real word each time, starting word is a car model
Can we not simply connect a battery to a RAM to prevent data loss during power cuts?
How do I reset the TSA-unlocked indicator on my lock?
Why is Trump releasing or not of his taxes such a big deal?
Milk instead of water in bread
Decrypting Multi-Prime RSA with e, N, and factors of N given
What makes RSA secure by using prime numbers?Knowing N and a relationship between the 2 prime numbers(p and q) find p and q generated with RSACan multi-prime RSA be used to create an abuse-resistant lawful interception mechanism?What's wrong with RSA and OpenSSL?Is it possible to check if a number is the product of two primes without factorizing it?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{
margin-bottom:0;
}
.everyonelovesstackoverflow{position:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;}
$begingroup$
I was wondering if there was any way to compute the private key $d$ when knowing only $e$ and $N$, and being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$. I've been searching for days and I can't find any way.
rsa multi-prime-rsa
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment
|
$begingroup$
I was wondering if there was any way to compute the private key $d$ when knowing only $e$ and $N$, and being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$. I've been searching for days and I can't find any way.
rsa multi-prime-rsa
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
3
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago
add a comment
|
$begingroup$
I was wondering if there was any way to compute the private key $d$ when knowing only $e$ and $N$, and being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$. I've been searching for days and I can't find any way.
rsa multi-prime-rsa
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I was wondering if there was any way to compute the private key $d$ when knowing only $e$ and $N$, and being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$. I've been searching for days and I can't find any way.
rsa multi-prime-rsa
rsa multi-prime-rsa
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
11.2k3 gold badges29 silver badges55 bronze badges
asked 8 hours ago
DominicDominic
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 hours ago
DominicDominic
61 bronze badge
asked 8 hours ago
DominicDominic
61 bronze badge
61 bronze badge
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Dominic is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
3
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago
add a comment
|
$begingroup$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
3
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago
$begingroup$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
3
3
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago
add a comment
|
1 Answer
1
active
oldest
votes
$begingroup$
In multi-prime RSA, with the factorization of $N$ into primes $p$, $q$, $r$, $s$ known, computing $d$ can be done as usual, e.g.$$dgets e^{-1}bmodoperatorname{lcm}(p-1,q-1,r-1,s-1)$$or$$dgets e^{-1}bmod((p-1)(q-1)(r-1)(s-1))$$
Note: the rationale of using multi-prime RSA is to obtain speedups that require not using $d$; but using $d$ will work anyway, only slower.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
$endgroup$
add a comment
|
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "281"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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/4.0/"u003ecc by-sa 4.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
});
}
});
Dominic is a new contributor. Be nice, and check out our Code of Conduct.
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%2fcrypto.stackexchange.com%2fquestions%2f74891%2fdecrypting-multi-prime-rsa-with-e-n-and-factors-of-n-given%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In multi-prime RSA, with the factorization of $N$ into primes $p$, $q$, $r$, $s$ known, computing $d$ can be done as usual, e.g.$$dgets e^{-1}bmodoperatorname{lcm}(p-1,q-1,r-1,s-1)$$or$$dgets e^{-1}bmod((p-1)(q-1)(r-1)(s-1))$$
Note: the rationale of using multi-prime RSA is to obtain speedups that require not using $d$; but using $d$ will work anyway, only slower.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
$endgroup$
add a comment
|
$begingroup$
In multi-prime RSA, with the factorization of $N$ into primes $p$, $q$, $r$, $s$ known, computing $d$ can be done as usual, e.g.$$dgets e^{-1}bmodoperatorname{lcm}(p-1,q-1,r-1,s-1)$$or$$dgets e^{-1}bmod((p-1)(q-1)(r-1)(s-1))$$
Note: the rationale of using multi-prime RSA is to obtain speedups that require not using $d$; but using $d$ will work anyway, only slower.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
$endgroup$
add a comment
|
$begingroup$
In multi-prime RSA, with the factorization of $N$ into primes $p$, $q$, $r$, $s$ known, computing $d$ can be done as usual, e.g.$$dgets e^{-1}bmodoperatorname{lcm}(p-1,q-1,r-1,s-1)$$or$$dgets e^{-1}bmod((p-1)(q-1)(r-1)(s-1))$$
Note: the rationale of using multi-prime RSA is to obtain speedups that require not using $d$; but using $d$ will work anyway, only slower.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
$endgroup$
In multi-prime RSA, with the factorization of $N$ into primes $p$, $q$, $r$, $s$ known, computing $d$ can be done as usual, e.g.$$dgets e^{-1}bmodoperatorname{lcm}(p-1,q-1,r-1,s-1)$$or$$dgets e^{-1}bmod((p-1)(q-1)(r-1)(s-1))$$
Note: the rationale of using multi-prime RSA is to obtain speedups that require not using $d$; but using $d$ will work anyway, only slower.
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
edited 5 hours ago
kelalaka
11.2k3 gold badges29 silver badges55 bronze badges
11.2k3 gold badges29 silver badges55 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
answered 7 hours ago
fgrieufgrieu
86.3k7 gold badges192 silver badges378 bronze badges
86.3k7 gold badges192 silver badges378 bronze badges
add a comment
|
add a comment
|
Dominic is a new contributor. Be nice, and check out our Code of Conduct.
Dominic is a new contributor. Be nice, and check out our Code of Conduct.
Dominic is a new contributor. Be nice, and check out our Code of Conduct.
Dominic is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Cryptography 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.
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%2fcrypto.stackexchange.com%2fquestions%2f74891%2fdecrypting-multi-prime-rsa-with-e-n-and-factors-of-n-given%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$
"being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$" - does this mean that you know/can find the values of $p, q, r, s$, or merely that you know that $N$ has 4 factors?
$endgroup$
– Ella Rose♦
8 hours ago
$begingroup$
I have found p, q, r and s. But I have no clue what way to go next. I've tried calculating the totient but I don't think that's the good way because I didn't get the answer I wanted.
$endgroup$
– Dominic
8 hours ago
$begingroup$
Thank you!! I will try it
$endgroup$
– Dominic
7 hours ago
3
$begingroup$
@fgrieu: that sounds like an answer; why don't you post it as one...
$endgroup$
– poncho
7 hours ago