On the invertibility of the XOR rotations of a binary word
We 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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Taylor & Francis Group
2012
|
| Online Access: | http://hdl.handle.net/1721.1/72052 https://orcid.org/0000-0002-7105-3690 |