Skip to main content
Post Reopened by fgrieu, e-sushi
Cleanup and retag
Source Link
fgrieu
  • 145.4k
  • 12
  • 319
  • 611

I HaveI'm given $N= pq$$N=p\,q$ and told that $44*p ≈ 17q$. N is a HUGE$44\,p\approx 17\,q$ (with the value given for $N$ some 49-digit integer N=8124642558124642555899928124642555899924479992447,8124642558124642555899928124642555899924479992447).

In RSA $p$ and $q$ must be a prime number and integer.

So how can resolveI solve this equation?

IamI'm using mapleMaple, i baganI began with s := evalf(solve(eqns, [p, q])) with eqns := {N = pq, 44p = 17*q}.

The result is not a prime number. How can iI put an otheranother condition to force p$p$ and q$q$ to be prime.? Or iamam I missing something?

Thank you for your help,Note of the editor: superlative HUGE removed for $N$, since it is way too small for RSA being secure.

I Have $N= pq$ and $44*p ≈ 17q$. N is a HUGE integer N=8124642558124642555899928124642555899924479992447,

In RSA $p$ and $q$ must be a prime number and integer.

So how can resolve this equation?

Iam using maple, i bagan with s := evalf(solve(eqns, [p, q])) with eqns := {N = pq, 44p = 17*q}.

The result is not a prime number. How can i put an other condition to force p and q to be prime. Or iam missing something

Thank you for your help,

I'm given $N=p\,q$ and told that $44\,p\approx 17\,q$ (with the value given for $N$ some 49-digit integer 8124642558124642555899928124642555899924479992447).

In RSA $p$ and $q$ must be prime.

So how can I solve this equation?

I'm using Maple, I began with s := evalf(solve(eqns, [p, q])) with eqns := {N = pq, 44p = 17*q}.

The result is not a prime number. How can I put another condition to force $p$ and $q$ to be prime? Or am I missing something?

Note of the editor: superlative HUGE removed for $N$, since it is way too small for RSA being secure.

added 244 characters in body; edited title
Source Link

RSA finding xp and yq integer with condition

I Have $G= x y$$N= pq$ and $i y \approx j y$$44*p ≈ 17q$. GN is a HUGE integer N=8124642558124642555899928124642555899924479992447, $i$ and $j$ are small int

how to solve this inIn RSA $x$$p$ and $y$$q$ must be a prime number and integer.

So how can resolve this equation?

Iam using maple, i bagan with s := evalf(solve(eqns, [p, q])) with eqns := {N = pq, 44p = 17*q}.

The result is not a prime number. How can i put an other condition to force p and q to be prime. Or iam missing something

Thank you for your help,

RSA finding x and y integer with condition

I Have $G= x y$ and $i y \approx j y$. G is a HUGE integer, $i$ and $j$ are small int

how to solve this in RSA $x$ and $y$ must be a prime number and integer.

So how can resolve this equation?

Thank you

RSA finding p and q integer with condition

I Have $N= pq$ and $44*p ≈ 17q$. N is a HUGE integer N=8124642558124642555899928124642555899924479992447,

In RSA $p$ and $q$ must be a prime number and integer.

So how can resolve this equation?

Iam using maple, i bagan with s := evalf(solve(eqns, [p, q])) with eqns := {N = pq, 44p = 17*q}.

The result is not a prime number. How can i put an other condition to force p and q to be prime. Or iam missing something

Thank you for your help,

Post Closed as "Needs details or clarity" by e-sushi
latex syntax and typos
Source Link
kelalaka
  • 49.5k
  • 12
  • 118
  • 205

I Have G= x*y$G= x y$ and iy ~ = jy $i y \approx j y$. G is a HUGE integer, i$i$ and j$j$ are small int

how to solve this in rsa xRSA $x$ and y$y$ must be a prime number and integer.

So how can resolve this equation?

Thank you

I Have G= x*y and iy ~ = jy . G is a HUGE integer, i and j are small int

how to solve this in rsa x and y must be prime number and integer.

So how can resolve this equation

Thank you

I Have $G= x y$ and $i y \approx j y$. G is a HUGE integer, $i$ and $j$ are small int

how to solve this in RSA $x$ and $y$ must be a prime number and integer.

So how can resolve this equation?

Thank you

Source Link
Loading