Content deleted Content added
Citation bot (talk | contribs) m Alter: template type. Add: arxiv, bibcode, pages, year, title, citeseerx, author pars. 1-3. Removed URL that duplicated unique identifier. Converted bare reference to cite template. | You can use this bot yourself. Report bugs here.| Activated by User:Quuux |
Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0 |
||
Line 25:
==History==
Krohn, Freedman and Mazieres proposed a theory<ref>{{Cite web |url=http://www.cs.princeton.edu/~mfreed/docs/authcodes-ieee04.pdf |title=Archived copy |access-date=2011-05-06 |archive-url=https://web.archive.org/web/20120316143135/http://www.cs.princeton.edu/~mfreed/docs/authcodes-ieee04.pdf |archive-date=2012-03-16 |url-status=dead }}</ref> in 2004 that if we have a hash function
<math>H : V \longrightarrow G</math> such that:
* <math>H</math> is [[Collision resistance|collision resistant]] – it is hard to find <math>x</math> and <math>y</math> such that <math>H(x) = H(y)</math>;
Line 154:
#[http://research.microsoft.com/pubs/69452/imc06.pdf Comprehensive View of a Live Network Coding P2P System]
#[http://research.microsoft.com/en-us/um/people/klauter/CISS_06.pdf Signatures for Network Coding(presentation) CISS 2006, Princeton]
#[https://web.archive.org/web/20110606191907/http://www.cse.buffalo.edu/~atri/courses/coding-theory/fall07.html University at Buffalo Lecture Notes on Coding Theory – Dr. Atri Rudra]
[[Category:Finite fields]]
| |||