Talk:Cover-coding

Computing Stub‑class

	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
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.

Would this be an appropriate reference (though also a dicdef, and slightly obscure to non-computer experts)? Jackiespeel (talk) 10:49, 1 March 2020 (UTC)[reply]

The article states that: "Cover coding is secure if the tag signal can't be intercepted and the random number is not re-used.". This is only true if the random number is just as long as the message being sent. Otherwise you are effectively re-using a one-time pad. If you know the random number length of N, it is possible to know the XOR value of two bits that are length N apart. In general all attacks that apply to re-using a one-time pad also apply here. — Preceding unsigned comment added by Rocqua (talk • contribs) 15:02, 9 June 2022 (UTC)[reply]

Validity

There does not seem to be anything on the internet about this topic - given that the article was created in 2006 and was effectively last updated in 2014 is there a more modern terminology? Jackiespeel (talk) 11:29, 20 January 2023 (UTC)[reply]