Sciweavers

2 search results - page 1 / 1
» Robust Finite Field Arithmetic for Fault-Tolerant Public-Key...
Sort
View
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
13 years 8 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
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 ...
Gunnar Gaubatz, Berk Sunar
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
13 years 8 months ago
Non-linear Residue Codes for Robust Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
Gunnar Gaubatz, Berk Sunar, Mark G. Karpovsky