Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / Computational soundness, symbolic models, XOR

Date: received 9 Jul 2010

Contact author: unruh at mmci uni-saarland de

Available format(s): PDF | BibTeX Citation

Version: 20100709:172408 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]