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

The signature of the whole script:

knoppix@Microknoppix:~$ python x.py S x.py

rabin signature - copyright Scheerer Software 2018 - all rights reserved

First parameter is V or S

verify signature (2 parameters):
  > python rsacrypt.py V <digital signature> 
create signature S (2 parameter):
  > python rsacrypt.py S <filename>

number of parameters is 2


write message file m
 digital signature:
176e15e4740f12af52f2643c86897cf44252e911f0a8921935c7b7742318f92073d5a2ac6d924ec34a4aa22e09eb32f5d2fe610e2e6509a8ec63a24b9799e4180e7752aeb71c889ace7d840022f7992c973d07b8c4c0333a5c08bbc5ef13f6e8bae9b8ad5a38868a38ea912a90a9fe29a4ed7572116545cc1134bde097f3ff858aaebd6a028508e9dc467a049eb17066e3bebfcfab832e14201ee64b822804ae7ebd3fb705b0b7a7353788ef72692bc1bb91dc3ca39f8341fc5260f512e73b8bc22f2534ca6c742500e68632c331e9f842a2088cf3d573fbd12c3bbfd85b5d02bf899486d2ed4d35689f0f28c01659eb51fb70b5c70d121286b7e127fa699ad

knoppix@Microknoppix:~$

Uups - not 'rsacrypt' but 'rabinsign' 84.118.82.226 (talk) 12:59, 13 February 2018 (UTC)[reply]

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

Why not both - Rabin and Rivest, Shamir, Adleman?

We may calculate from the same prime numbers p and q the combined signatur $S$ as funtion of the message $m$ .

S(m,p,q):=S_{Rabin}(m,p,q)+S_{RSA}(m,p,q)

If it is impossible to calculate the primes $p$ and $q$ from the value of $n=p\cdot q$ , the signature is definitely secure.

--84.118.82.226 (talk) 09:35, 13 February 2018 (UTC)[reply]

See also: http://iaktueller.de/rsa.py — Preceding unsigned comment added by 84.118.82.226 (talk) 08:07, 14 February 2018 (UTC)[reply]