Timeline for How to decrypt c when phi(n) and e are not relatively prime [duplicate]

Current License: CC BY-SA 4.0

16 events

when toggle format	what		by	license	comment
Aug 27, 2020 at 21:48	history	rollback	kelalaka		Rollback to Revision 2
Aug 27, 2020 at 21:47	comment	added	kelalaka		When $n$ is prime than it is not RSA. It is Pohlig-Hellman Cipher. I've roll-back your edit. If you really consider $n$ is prime, then please read about Pohlig-Hellman Cipher. In RSA, we need at least two distinct primes...
Aug 27, 2020 at 21:30	review	Reopen votes
Sep 3, 2020 at 17:12
Aug 27, 2020 at 21:21	comment	added	fgrieu♦		Regarding Can someone explain how to decrypt $c$ if $n$ is prime, and $\phi(n)$ and $e$ aren't relatively prime?: have you checked poncho's answer which has a large intersection with your case?
Aug 27, 2020 at 21:11	history	edited	Yolo	CC BY-SA 4.0	added 35 characters in body
Aug 27, 2020 at 18:46	comment	added	Maarten Bodewes♦		@poncho The answer was moved, you could copy above comment there if you want, as the mods seemingly cannot.
Aug 27, 2020 at 18:05	history	duplicates list edited	fgrieu♦		duplicates list edited from RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$? to RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Aug 27, 2020 at 18:05	history	duplicates list edited	fgrieu♦		duplicates list edited from In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$? to RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?, In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Aug 27, 2020 at 16:48	comment	added	fgrieu♦		This answer was moved here since it fits that other question well.
Aug 27, 2020 at 13:32	comment	added	poncho		Actually, the crypto.stackexchange.com/questions/81949/… answer addresses the specific question Yolo asked
Aug 27, 2020 at 13:28	history	closed	kelalaka ckamath poncho rsa		Duplicate of In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?, How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Aug 27, 2020 at 9:08	review	Close votes
Aug 27, 2020 at 13:37
Aug 27, 2020 at 8:52	comment	added	kelalaka		This is the exact dupe : In RSA encryption, why does the public exponent (usually, 'e') have to be coprime with $\varphi(n)$?
Aug 27, 2020 at 7:05	history	edited	kelalaka	CC BY-SA 4.0	polish
Aug 27, 2020 at 2:19	review	First posts
Aug 27, 2020 at 11:55
Aug 27, 2020 at 2:12	history	asked	Yolo	CC BY-SA 4.0

toggle format