Talk:Ring signature

Cryptography: Computer science Mid‑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 articles
Mid	This article has been rated as Mid-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Mid-importance).

Content of at least one revision of the associated article was derived in whole or part from non-free copyrighted material on the website https://github.com/monero-project/monero-site/. This material was (prior to placement or subsequently) freely licensed in a manner compatible for Wikipedia's use by the posting of one or more compatible copyright licenses on the external website. Though the release notice for the material, which is irrevocable, may have been later removed from view, or the URL may have changed or gone dead, an archive of that webpage, including the copyright release notice, is available at https://web.archive.org/web/20240820030620/https://github.com/monero-project/monero-site/.

Pseudo-code is relatively useless for the purposes of understanding something. It should be replaced with a concise mathematical description of the combining function, etc. — Preceding unsigned comment added by 131.254.145.74 (talk) 18:42, 8 October 2017 (UTC)[reply]

I suppose your reference to pseudo-code was to the (barely readable) Python code. I just added an initial description of the mathematics; c&c is very welcome. If we all agree on the typesetting of the maths, we could remove this piece of code? Rubdos (talk) 15:15, 27 October 2017 (UTC)[reply]

FWIW, I posted a crypto.SE question about this implementation. So far, it actually looks like it works, but no-one can provide with a possible source. Rubdos (talk) 09:53, 1 November 2017 (UTC)[reply]