Talk:Concrete security

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

Could someone give me some feedback on whether the article in the current form is comprehensible please. Thanks Arvindn 04:49, 23 July 2005 (UTC)Reply

Arvind, The article looks good but for some minor issues.

The following passage doesn't make it clear to a naive reader about what is an "oracle query". Also, the phrase "number of plaintexts it can see" reads rather unencyclopedic.

Concrete security parametrizes all the resources available to the adversary, such as running time, memory, number of oracle queries, number of plaintexts it can see, etc. (the exact list is problem specific.) Then the advantage of the adversary is upper bounded as a function of these resources and of the problem size. It is often possible to give a lower bound (i.e, an adversarial strategy) matching the upper bound, hence the name exact security.

One other minor issue is the linking of the words "significant" and "advantage" to entirely different articles. Not many would assume that they might lead to these topics. -- Sundar ^{\talk \contribs} 13:28, July 29, 2005 (UTC)

Fixed, thanks Arvindn 16:37, 29 July 2005 (UTC)Reply

Add topic