This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

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 articles 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). Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics 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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles Low This article has been rated as Low-priority on the project's priority scale.

I changed "widely-used" to "important" because I don't think Blum Blum Shub is widely used. Arvindn 03:48, 18 Jul 2004 (UTC)

Article mentions discrete logarithm as a problem immune to TWIRL. AFAIK this may not be true, as TWIRL can likely be adapted for the function field sieve DLP solving algorithm, which is closely related to GNFS. -- NetRolller 3D 17:16, 31 December 2015 (UTC) reply