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).

I would say it is perfect - we can not improve it!

If integer factorization is really hard, it is perfect.

84.118.82.226 (talk) 09:39, 9 February 2018 (UTC)[reply]

Why we don't just use it? It's at least as secure as the RSA_(cryptosystem) and verification is even more easy. 84.118.82.226 (talk) 21:50, 11 February 2018 (UTC)[reply]

Here is the Python 2.x script: http://iaktueller.de/x.py — Preceding unsigned comment added by 84.118.82.226 (talk) 11:17, 12 February 2018 (UTC)[reply]

Tell me, if is so perfect, why noboby use it?

def nextPrime(p):

while p % 4 != 3:
  p = p + 1
return nextPrime_3(p)

def nextPrime_3(p):

 m_ = 3*5*7*11*13*17*19*23*29
 while gcd(p,m_) != 1:
   p = p + 4 
 if (pow(2,p-1,p) != 1):
     return nextPrime_3(p + 4)
 if (pow(3,p-1,p) != 1):
     return nextPrime_3(p + 4)
 if (pow(5,p-1,p) != 1):
     return nextPrime_3(p + 4)
 if (pow(17,p-1,p) != 1):
     return nextPrime_3(p + 4)
 return p

--84.118.82.226 (talk) 14:42, 12 February 2018 (UTC)[reply]