A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
[chapter]
2006
Lecture Notes in Computer Science
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring elements into larger rings via suitable homomorphisms obtained from modulus scaling. Our approach is closely related to, but not limited by the theory of cyclic binary and arithmetic codes. We present a framework for system-designers that allows flexible trade-offs between circuit area and desired level of fault
doi:10.1007/11889700_18
fatcat:wzqcbyorlzg7rn7self5xrxeda