Talk:Rabin signature algorithm

Cryptography: Computer science Start‑class Top‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Top	This article has been rated as Top-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Top-importance).

But is RSA really insecure or less secure?

I don't believe so. It looks quite obvious, that

S^{e}\mod n

is not less secure than

S^{2}\mod n

The public exponent e here is any number greater than rwo with gcd(e, (p-1)(q-1)) equals one.

Next argument: If we find the exponent d in RSA, we can also can find the prime factors.

--84.118.82.226 (talk) 08:06, 20 April 2018 (UTC)[reply]