Paper 2010/389 Original: eprint.iacr.org/2010/389 ↗
The impossibility of computationally sound XOR
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
- Preprint.
- History
- 2010-07-09: last updated
- 2010-07-09: published
- Short URL
- https://ia.cr/2010/389
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}