Introduction to finite fields and their applications
Introduction to finite fields and their applications
Modern computer algebra
Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
Breaking Public Key Cryptosystems on Tamper Resistant Devices in the Presence of Transient Faults
Proceedings of the 5th International Workshop on Security Protocols
Towards fault-tolerant cryptographic computations over finite fields
ACM Transactions on Embedded Computing Systems (TECS)
Robust finite field arithmetic for fault-tolerant public-key cryptography
FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
Montgomery Residue Representation Fault-Tolerant Computation in GF(2k)
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
In this paper, we propose a new method for fault tolerant computation over GF(2k) for use in public key cryptosystems. In particular, we are concerned with the active side channel attacks, i.e., fault attacks. We define a larger ring in which new computation is performed with encoded elements while arithmetic structure is preserved. Computation is decomposed into parallel, mutually independent, identical channels, so that fault effects do not spread to the other channels. By assuming certain fault models, our proposed model provides protection against their error propagation. Also, we provide an analysis of the error detection and correction capabilities of our proposed model.