Show simple item record

dc.contributor.authorRivest, Ronald L.
dc.date.accessioned2012-08-08T20:33:17Z
dc.date.available2012-08-08T20:33:17Z
dc.date.issued2010-12
dc.date.submitted2009-11
dc.identifier.issn0020-7160
dc.identifier.issn1029-0265
dc.identifier.urihttp://hdl.handle.net/1721.1/72052
dc.description.abstractWe prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not new; there is at least one earlier proof, due to Thomsen [Cryptographic hash functions, PhD thesis, Technical University of Denmark, 28 November 2008]. Our proof may be new.)en_US
dc.language.isoen_US
dc.publisherTaylor & Francis Groupen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/00207161003596708en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceRivest via Amy Stouten_US
dc.titleOn the invertibility of the XOR rotations of a binary worden_US
dc.title.alternativeThe invertibility of the XOR of rotations of a binary worden_US
dc.typeArticleen_US
dc.identifier.citationRivest, Ronald. “The Invertibility of the XOR of Rotations of a Binary Word.” International Journal of Computer Mathematics (2011) 88.2 : 1–4.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverRivest, Ronald L.
dc.contributor.mitauthorRivest, Ronald L.
dc.relation.journalInternational Journal of Computer Mathematicsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsRivest, Ronalden
dc.identifier.orcidhttps://orcid.org/0000-0002-7105-3690
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record