Talk:Cover-coding
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Untitled
[edit]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)
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)
Validity
[edit]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)