Talk:Station-to-Station protocol

Computing Start‑class 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 articles
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-importance on the project's importance scale.

Cryptography: Computer science Unassessed

	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
???	This article has not yet received a rating on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the importance scale.
	This article is supported by WikiProject Computer science.

Intro Context

Regarding the context template, I'm not sure what to do. The initial sentence seems to give a accessible introduction to this esoteric subject. The second paragraph states several obscure but important characteristics, and the third is, I think, a pleasant history. I'm actually quite happy with the intro, but I'll admit to some bias.. does anyone have any suggestions? - ladenedge (talk) 17:40, 3 September 2008 (UTC)[reply]

Question concerning example for Basic STS

I think the first step might be wrong: (1) Alice -> Bob : g^x Shouldn't it be: (1) Alice -> Bob : g^x mod p ? Otherwise it would be easy for Eve figuring out the random number x. See also: here. --212.77.163.102 (talk) 14:04, 16 November 2011 (UTC)[reply]