Jump to content

Talk:Rabin signature algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 11:18, 12 February 2018 (Signing comment by 84.118.82.226 - "→I would say it is perfect - we can not improve it!: "). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconCryptography: Computer science Start‑class Top‑importance
WikiProject iconThis 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
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
TopThis article has been rated as Top-importance on the importance scale.
Taskforce icon
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 script: http://iaktueller.de/x.py — Preceding unsigned comment added by 84.118.82.226 (talk) 11:17, 12 February 2018 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Rabin_signature_algorithm&oldid=825261289"