Single error correctable bit parallel multipliers over GF(2m)

Single error correctable bit parallel multipliers over GF(2m)

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Motivated by the problems associated with soft errors in digital circuits and fault-related attacks in cryptographic hardware, a systematic method for designing single error correcting multiplier circuits is presented for finite fields or Galois fields over GF(2m). Multiple parity predictions to correct single errors based on the Hamming principles are used. The expressions for the parity prediction are derived from the input operands, and are based on the primitive polynomials of the fields. This technique, when compared with existing ones, gives better performance. It is shown that single error correction (SEC) multipliers over GF(2m) require slightly over 100% extra hardware, whereas with the traditional SEC techniques, this figure is more than 200%. Since single bit internal faults can cause multiple faults in the outputs, this has also been addressed here by using multiple Hamming codes with optimised hardware.


    1. 1)
      • Robust system design with built-in soft error resilience
    2. 2)
      • On the importance of eliminating errors in cryptographic computations
    3. 3)
      • Elliptic curve cryptosystems in the presence of permanent and transient faults
    4. 4)
      • Online error detection for bit-seial multipliers in GF(2m)
    5. 5)
      • Fault detection architectures for field multiplication using polynomial bases, IEEE 91(11)
    6. 6)
      • Gaubatz, G., Sunar, B.: `Robust finite field arithmetic for fault-tolerant public-key cryptography', 2ndWorkshop on Fault Tolerance and Diagnosis in Cryptography (FTDC), 2005
    7. 7)
      • Online testing for VLSI - A compendium of approaches
    8. 8)
      • Towards fault-tolerant cryptographic computations over finite fields
    9. 9)
      • On concurrent detection of errors in polynomial basis multiplication
    10. 10)
      • Concurrent error detection in a polynomial basis multiplier over GF(2m)
    11. 11)
      • C-testable bit parallel multipliers over GF(2m)
    12. 12)
      • A theory of galois switching functions
    13. 13)
      • Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
    14. 14)
      • Mastrovito, E.D.: `VLSI architectures for computation in galois fields', 1991, PhD, Linkping University, Sweden
    15. 15)
      • Error detecting and error correcting codes
    16. 16)
      • Concurrent error detection in a bit-parallel systolic multiplier for dual basis of GF(2m)

Related content

This is a required field
Please enter a valid email address