An Open Question on the Uniqueness of (Encrypted) Arithmetic
Abstract
We ask whether two or more images of arithmetic may inhabit the same space via different encodings. The answers have significance for a class of processor design that does all its computation in an encrypted form, without ever performing any decryption or encryption itself. Against the possibility of algebraic attacks against the arithmetic in a `crypto-processor' (KPU) we propose a defence called `ABC encryption' and show how this kind of encryption makes it impossible for observations of the arithmetic to be used by an attacker to discover the actual values. We also show how to construct such encrypted arithmetics.
Cite
@article{arxiv.1306.0018,
title = {An Open Question on the Uniqueness of (Encrypted) Arithmetic},
author = {Peter T. Breuer and Jonathan P. Bowen},
journal= {arXiv preprint arXiv:1306.0018},
year = {2013}
}
Comments
Withdrawn by authors after acceptance for ICCS 2013 (one of the conjectures that appears in the text was disproved by the authors after submission); 9 pages