Talk:Trace zero cryptography

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Cryptography: Computer science

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

This article is writen like a math review paper. However, wikipedia enteries are not math journal papers. In particular, they don't end in conclusion, resume, etc. I am incorporating the resume part in the intro Bossudenotredame (talk) 13:20, 5 May 2012 (UTC)[reply]

Also I found "Alternatively, one can find cryptographically secure groups by searching a family of randomly chosen curves.^[1]" not relavant to this article. One can produce crypto interesting groups in thousands of way, but we don't need to mention it here. Bossudenotredame (talk) 13:30, 5 May 2012 (UTC)[reply]

^ A. V. Sutherland: "A generic approach to searching for Jacobians"

[1] A. V. Sutherland: "A generic approach to searching for Jacobians"

[1]