Introduction to finite fields and their applications
Introduction to finite fields and their applications
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Modern computer algebra
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
VLSI Designs for Multiplication over Finite Fields GF (2m)
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Differential Fault Attacks on Elliptic Curve Cryptosystems
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Breaking Public Key Cryptosystems on Tamper Resistant Devices in the Presence of Transient Faults
Proceedings of the 5th International Workshop on Security Protocols
Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography
ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
Towards fault-tolerant cryptographic computations over finite fields
ACM Transactions on Embedded Computing Systems (TECS)
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Designs, Codes and Cryptography
Parallel Montgomery Multiplication in GF (2^k) Using Trinomial Residue Arithmetic
ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Fault-tolerant finite field computation in the public key cryptosystems
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
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
| Hi-index | 0.00 |
In this paper, we are concerned with protecting elliptic curve computation in a tamper proof device by protecting finite field computation against active side channel attacks, i.e., fault attacks. We propose residue representation of the field elements for fault tolerant Montgomery residue representation multiplication algorithm, by providing fault models for fault attacks, and countermeasures to some fault inducing attacks.