
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Arash ReyhaniMasoleh, M. Anwar Hasan, "Fault Detection Architectures for Field Multiplication Using Polynomial Bases," IEEE Transactions on Computers, vol. 55, no. 9, pp. 10891103, September, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.147, author = {Arash ReyhaniMasoleh and M. Anwar Hasan}, title = {Fault Detection Architectures for Field Multiplication Using Polynomial Bases}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {9}, issn = {00189340}, year = {2006}, pages = {10891103}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.147}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fault Detection Architectures for Field Multiplication Using Polynomial Bases IS  9 SN  00189340 SP1089 EP1103 EPD  10891103 A1  Arash ReyhaniMasoleh, A1  M. Anwar Hasan, PY  2006 KW  Finite fields KW  polynomial basis multiplier KW  error detection. VL  55 JA  IEEE Transactions on Computers ER   
[1] G.B. Agnew, T. Beth, R.C. Mullin, and S.A. Vanstone, “Arithmetic Operations in $GF(2^m)$ ,” J. Cryptology, vol. 6, pp. 313, 1993.
[2] G. Bertoni, L. Breveglieri, I. Koren, P. Maistri, and V. Piuri, “Error Analysis and Detection Procedures for a Hardware Implementation of the Advanced Encryption Standard,” IEEE Trans. Computers, special issue on cryptographic hardware and embedded systems, vol. 52, no. 4, pp. 492505, Apr. 2003.
[3] D. Boneh, R.A. DeMillo, and R.J. Lipton, “On the Importance of Eliminating Errors in Cryptographic Computations,” J. Cryptology, vol. 14, pp. 101119, 2001.
[4] M. Ciet and M. Joye, “Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults,” Designs, Codes, and Cryptography, vol. 36, no. 1, pp. 3343, 2005.
[5] S. Fenn, M. Gossel, M. Benaissa, and D. Taylor, “OnLine Error Detection for BitSerial Multipliers in $GF(2^m)$ ,” J. Electronic Testing: Theory and Applications, vol. 13, pp. 2940, 1998.
[6] A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 49, no. 5, pp. 503518, May 2000.
[7] B.W. Johnson, Design and Analysis of FaultTolerant Digital Systems. AddisonWesley, 1989.
[8] M. Joye, A.K. Lenstra, and J.J. Quisquater, “Chinese Remaindering Based Cryptosystems in the Presence of Faults,” J. Cryptology, vol. 12, pp. 241245, 1999.
[9] E.D. Mastrovito, “VLSI Designs for Multiplication over Finite Fields $GF(2^m)$ ,” Proc. Symp. Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC6), pp. 297309, July 1988.
[10] E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields,” PhD thesis, Linkoping Univ., Linkoping, Sweden, 1991.
[11] M. Nicolaidis, R.O. Duarte, S. Manich, and J. Figueras, “FaultSecure Parity Prediction Arithmetic Operators,” IEEE Design and Test of Computers, pp. 6071, Apr.June 1997.
[12] C. Paar, P. Fleishmann, and P. SoriaRodriguez, “Fast Arithmetic for PublicKey Algorithms in Galois Fields with Composite Exponents,” IEEE Trans. Computers, vol. 48, no. 10, pp. 10251034, Oct. 1999.
[13] A. ReyhaniMasoleh and M.A. Hasan, “Error Detection in Polynomial Basis Multipliers over Binary Extension Fields,” Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES 2002), pp. 515528, Aug. 2002.
[14] A. ReyhaniMasoleh and M.A. Hasan, “Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over $GF(2^m)$ ,” IEEE Trans. Computers, vol. 53, no. 8, pp. 945959, Aug. 2004.
[15] F. RodriguezHenriquez and Ç.K. Koç, “Parallel Multipliers Based on Special Irreducible Pentanomials,” IEEE Trans. Computers, vol. 52, no. 12, pp. 15351542, Dec. 2003.
[16] G. Seroussi, “Table of LowWeight Binary Irreducible Polynomials,” HP Labs Technical Report HPL98135, Aug. 1998.
[17] H. Wu, “BitParallel Finite Field Multiplier and Squarer Using Polynomial Basis,” IEEE Trans. Computers, vol. 51, no. 7, pp. 750758, July 2002.
[18] H. Wu and M.A. Hasan, “Efficient Exponentiation of a Primitive Root in $GF(2^m)$ ,” IEEE Trans. Computers, vol. 46, no. 2, pp. 162172, Feb. 1997.
[19] K. Wu, R. Karri, G. Kuznetsov, and M. Goessel, “Low Cost Concurrent Error Detection for the Advanced Encryption Standard,” Proc. IEEE Int'l Test Conf. (ITC 2004), pp. 12421248, 2004.
[20] T. Zhang and K.K. Parhi, “Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 50, no. 7, pp. 734748, July 2001.