Paper 2010/389

The impossibility of computationally sound XOR

Dominique Unruh

Abstract

We give a simple example that there is no symbolic theory for exclusive or (XOR) that is computationally sound.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Computational soundnesssymbolic modelsXOR
Contact author(s)
unruh @ mmci uni-saarland de
History
2010-07-09: received
Short URL
https://ia.cr/2010/389
License
Creative Commons Attribution
CC BY

BibTeX 

@misc{cryptoeprint:2010/389,
      author = {Dominique Unruh},
      title = {The impossibility of computationally sound {XOR}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/389},
      year = {2010},
      url = {https://eprint.iacr.org/2010/389}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.