Talk:Blum–Micali algorithm

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

Untitled

In the method $g$ should not be a prime number; even it needs not to be a primitive root. —Preceding unsigned comment added by 193.6.218.224 (talk) 12:06, 30 March 2010 (UTC)[reply]

"Prime" is probably a typo for "primitive root" in Schneier. The original paper does specify that $g$ should be a primitive root; it may not be necessary but it improves the security proof because the DLP is harder. Doctorhook (talk) 00:26, 4 June 2010 (UTC)[reply]