Talk:Lyra2

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

Computing Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.

Contested deletion

This article should not be speedy deleted as having no substantive content, because Lyra2 is a notable Password Hashing Scheme. — Preceding unsigned comment added by Erandrade (talk • contribs)

Issues fixed (2019-11-08)

Removed [advert] because the reason was "self-promotion by one of the authors of the algo: most of the article is written by a single-purpose account "Erandrade". Actually, the algo was published in a scientific journal (IEEE Transactions on Computers), and has multiple usages to date (as shown by newly added references; hence, this is not a case of self-promotion, but simply of describing an algorithm with real-world interest.

Removed [primary sources] because extra sources added. More can be found at https://scholar.google.com.br/scholar?cites=15825261047073480942&as_sdt=2005&sciodt=0,5

Removed [refimprove] because all citations required were fixed — Preceding unsigned comment added by 143.107.151.34 (talk) 15:46, 8 November 2019 (UTC)[reply]