Journal of Electronic Testing

, Volume 22, Issue 2, pp 143–150 | Cite as

Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2 m )

  • Chiou-Yng Lee
  • Che Wun Chiou
  • Jim-Min Lin


Eliminating cryptographic computation errors is vital for preventing attacks. A simple approach is to verify the correctness of the cipher before outputting it. The multiplication is the most significant arithmetic operation among the cryptographic computations. Hence, a multiplier with concurrent error detection ability is urgently necessary to avert attacks. Employing the re-computing shifted operand concept, this study presents a semi-systolic array polynomial basis multiplier with concurrent error detection with minimal area overhead. Moreover, the proposed multiplier requires only two extra clock cycles while traditional multipliers using XOR trees consume at least \(\left\lceil {\log _2 m} \right\rceil\) extra XOR gate delays in GF(2 m ) fields.


finite fields arithmetic multiplier fault-tolerant computing fault detection cryptography 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam, North-Holland, 1977.Google Scholar
  2. 2.
    R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications; Cambridge Univ. Press, New York 1994.MATHGoogle Scholar
  3. 3.
    R.E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading, Mass., 1985.MATHGoogle Scholar
  4. 4.
    I.S. Reed and T.K. Truong, “The Use of Finite Fields to Compute Convolutions,” IEEE Trans. Information Theory, Vol. IT-21, No. 2, pp. 208–213, 1975.CrossRefMathSciNetGoogle Scholar
  5. 5.
    B. Benjauthrit and I.S. Reed, “Galois Switching Functions and Their Applications,” IEEE Trans. Computers, Vol. C-25, pp. 78–86, Jan. 1976.MathSciNetCrossRefGoogle Scholar
  6. 6.
    C.C. Wang and D. Pei, “A VLSI Design for Computing Exponentiation in GF(2m) and its Application to Generate Pseudorandom Number Sequences,” IEEE Trans. Computers, Vol. 39, No. 2, pp. 258–262, Feb. 1990.CrossRefMathSciNetGoogle Scholar
  7. 7.
    T.C. Bartee and D.J. Schneider, “Computation with Finite Fields,” Information and Computing, Vol. 6, pp. 79–98, Mar. 1963.MathSciNetMATHGoogle Scholar
  8. 8.
    E.D. Mastrovito, “VLSI Architectures for Multiplication Over Finite Field GF(2m),” Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Proc. Sixth Int’l Conf., AAECC-6, T. Mora, (Ed.), Rome, July 1988, pp. 297–309.Google Scholar
  9. 9.
    Ç.K. Koç and B. Sunar, “Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields,” IEEE Trans. Computers, Vol. 47, No. 3, pp. 353–356, 1998.CrossRefGoogle Scholar
  10. 10.
    C.Y. Lee, “Low Complexity Bit-Parallel Systolic Multiplier Over GF(2m) using Irreducible Trinomials,” IEE Proc.-Comput. Digit. Tech., Vol. 150, No. 1, pp. 39–42, Jan. 2003.CrossRefGoogle Scholar
  11. 11.
    T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Fields GF(2m),” Information and Computation, Vol. 83, pp. 21–40, 1989.CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    M.A. Hasan, M. Wang, and V.K. Bhargava, “Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2m),” IEEE Trans. Computers, Vol. 41, No. 8, pp. 962–971, 1992.CrossRefMathSciNetGoogle Scholar
  13. 13.
    C.Y. Lee, E.H. Lu, and J.Y. Lee, “Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally-Spaced Polynomials,” IEEE Trans. Computers, Vol. 50, No. 5, pp. 385–393, 2001.CrossRefMathSciNetGoogle Scholar
  14. 14.
    C. Paar, “A New Architecture For a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,” IEEE Trans. Computers, Vol. 45, No. 7, pp. 856–861, 1996.CrossRefMathSciNetMATHGoogle Scholar
  15. 15.
    C.W. Chiou, L.C. Lin, F.H. Chou, and S.F. Shu, “Low Complexity Finite Field Multiplier Using Irreducible Trinomials,” Electronics Letters, Vol. 39, No. 24, pp. 1709–1711, 2003.CrossRefGoogle Scholar
  16. 16.
    J.L. Massey and J.K. Omura, “Computational method and apparatus for finite field arithmetic,” U.S. Patent Number 4,587,627, May 1986.Google Scholar
  17. 17.
    A. Reyhani-Masoleh and M.A. Hasan, “A New Construction of Massey-Omura Parallel Multiplier Over GF(2m),” IEEE Trans. Computers, Vol. 51, No. 5, pp. 511–520, 2002.CrossRefMathSciNetGoogle Scholar
  18. 18.
    E.R. Berlekamp, “Bit-Serial Reed-Solomon Encoders,” IEEE Trans. Information Theory, Vol. IT-28, pp. 869–874, 1982.CrossRefGoogle Scholar
  19. 19.
    H. Wu, M.A. Hasan, and I.F. Blake, “New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases,” IEEE Trans. Computers, Vol. 47, No. 11, pp. 1223–1234, November 1998.CrossRefMathSciNetGoogle Scholar
  20. 20.
    J. Kelsey, B. Schneier, D. Wagner, and C. Hall, “Side-Channel Cryptanalysis of Product Ciphers,” Proc. of ESORICS, Springer, Sep.1998., pp. 97–110Google Scholar
  21. 21.
    E. Biham and A. Shamir, “Differential Fault Analysis of Secret Key Cryptosystems,” Proceedings of Crypto, Springer LNCS 1294, 1997, pp. 513–525Google Scholar
  22. 22.
    D. Boneh, R. DeMillo, and R. Lipton, “On the Importance of Checking Cryptographic Protocols for Faults,” Proc. of Eurocrypt, Springer LNCS 1233, pp. 37–51, 1997.Google Scholar
  23. 23.
    R. Karri, G. Kuznetsov, and M. Goessel, “Parity-Based Concurrent Error Detection of Substitution-Permutation Network Block Ciphers,” Proc. of CHES 2003, Springer LNCS 2779, 2003, pp. 113–124.Google Scholar
  24. 24.
    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, Vol. 52, No. 4, pp. 492–505, 2003.CrossRefGoogle Scholar
  25. 25.
    M. Joye, A. Lenstra, J.-J. Quisquater, “Chinese remaindering based cryptosystems in the presence of faults,” Journal of Cryptology, Vol. 12, pp. 241–245, 1999.CrossRefMATHGoogle Scholar
  26. 26.
    D. Boneh, R. DeMillo, and R.J. Lipton, “On The Importance of Eliminating Errors in Cryptographic Computations,” Journal of Cryptology, Vol. 14, pp. 101–119, 2001.CrossRefMathSciNetMATHGoogle Scholar
  27. 27.
    S. Fenn, M. Gossel, M. Benaissa, and D. Taylor, “On-line Error Detection for Bit-Serial Multipliers in GF(2m),” Journal of Electronic Testing: Theory and Applications, Vol. 13, pp. 29–40, 1998.CrossRefGoogle Scholar
  28. 28.
    A. Reyhani-Masoleh and M.A. Hasan, “Error Detection in Polynomial Basis Multipliers Over Binary Extension Fields,” Proc. of Cryptographic Hardware and Embedded Systems-CHES 2002, LNCS 2523, pp. 515–528, 2003.Google Scholar
  29. 29.
    C.-Y. Lee, C.W. Chiou, and J.-L. Lin, “Concurrent Error Detection in A Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m),” Journal of Electronic Testing: Theory and Applications, Vol. 21, No. 5, pp. 539–549, 2005.CrossRefGoogle Scholar
  30. 30.
    C.W. Chiou, “Concurrent Error Detection in Array Multipliers for GF(2m) Fields,” IEE Electronics Letters, Vol. 38, No. 14, pp. 688–689, 4th July 2002.CrossRefGoogle Scholar
  31. 31.
    J.H. Patel and L.Y. Fung, “Concurrent Error Detection in ALU’s by Recomputing with Shifted Operands,” IEEE Trans. Computers, Vol. C-31, No. 7, pp. 589–595, 1982.Google Scholar
  32. 32.
    J.H. Patel and L.Y. Fung, “Concurrent Error Detection in Multiply and Divide Arrays,” IEEE Trans. Computers, Vol. C-32, No. 4, pp. 417–422, 1983.Google Scholar
  33. 33.
    R.H. Minero, A.J. Anello, R.G. Furey, and L.R. Palounek, “Checking by Pseuduplication,” U.S. Patent 3660646, May 1972.Google Scholar
  34. 34.
    Applications of Finite Fields, A.J. Menezes, (Ed.), Kluwer Academic, Boston, 1993.Google Scholar
  35. 35.
    P.K. Lala, Fault tolerant & Fault Testable Hardware Design, London, Prentice-Hall International, Inc., 1985.Google Scholar
  36. 36.
    K.Z. Pekmestzi, “Multiplexer-Based Array Multipliers,” IEEE Trans. Computers, Vol. 48, No. 1, pp. 15–23, 1999.CrossRefMathSciNetGoogle Scholar
  37. 37.
    R.J. Baker, H.W. Li, and D.E. Boyce, CMOS-Circuit, Design, Layout, and Simulation, IEEE Press, New York, 1998.Google Scholar
  38. 38.
    S.M. Kang and Y. Leblebici, CMOS Digital Integrated Circuits-Analysis and Design, McGraw-Hill, 1999.Google Scholar
  39. 39.
    G.-Y. Byun and H.-S. Kim, “Low-Complexity Multiplexer-Based Multiplier of GF(2m),” IEICE Trans. Infor. & Syst., Vol. E86-D, No. 12, pp. 2684–2690, 2003.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Computer Information and Network EngineeringLunghwa University of Science and TechnologyTaoyuan CountyR.O.C.
  2. 2.Department of Computer Science and Information EngineeringChing Yun UniversityChung-LiR.O.C.
  3. 3.Department of Information Engineering and Computer ScienceFeng Chia UniversityTaichung CityR.O.C.

Personalised recommendations