Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Concurrent error detection in GF(2m) multiplication and its application in elliptic curve cryptography

Concurrent error detection in GF(2m) multiplication and its application in elliptic curve cryptography

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

Buy article PDF
£12.50
(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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Circuits, Devices & Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A novel approach to achieve concurrent error detection in finite-field multiplication over GF(2m) that uses multiple-bit interlaced parity codes is presented. These codes are implemented as a generic parity checker, which means they can be used with any multiplier architecture. Relative to the number of parity bits used, much improved delay and error‐detection performance are achieved compared to previously reported results, yet for the examples considered the area overhead did not exceed 12%. The proposed work is particularly important for cryptography implementations employing GF(2m) multipliers and requiring reliability and protection against adversarial attacks that use fault induction.

References

    1. 1)
    2. 2)
    3. 3)
      • A. Reyhani-Masoleh , M.A. Hasan . Towards fault-tolerant cryptographic computations over finite fields. ACM Trans. Embedded Comput. Sys. , 593 - 613
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Biehl, I., Meyer, B., Muller, V.: `Differential fault attacks on elliptic curve cryptosystems', Proc. 20th Annual Int. Cryptology Conf. Advances in Cryptology, (Lect. Notes Comput. Sci.), 2000, 1880, p. 131–146.
    8. 8)
      • Bar-El, H., Choukri, H., Naccache, D., Tunstall, M., Whelan, C.: ‘The sorcerer's apprentice guide to fault attacks’, IACR Cryptology ePrint Archive, available at: http://eprint.iacr.org/2004/.
    9. 9)
      • NIST – National Institute of Standards and Technology: ‘Recommended elliptic curves for federal government use’, available at: http://csrc.nist.gov/encryption, 2000..
    10. 10)
      • Reyhani-Masoleh, A., Hasan, M.A.: `Error detection in polynomial basis multipliers over binary extension fields', Workshop on Cryptographic Hardware and Embedded Systems (CHES 2002), 2002, Redwood Shores, CA, USA.
    11. 11)
    12. 12)
      • Seroussi, G.: ‘Table of low weight binary irreducible polynomials’, available at: http://www.hpl.hp.com/techreports/98/HPL-98-135.pdf, 1998..
    13. 13)
    14. 14)
    15. 15)
      • Bayat-Sarmadi, S., Hasan, M.A.: `Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme', 20thIEEE Int. Symp. Defect and Fault Tolerance in VLSI Systems, 2005, DFT.
    16. 16)
      • Mastrovito, E.: `VLSI architectures for computations in galois fields’.', 1991, PhD, Linkoping University, Department of Electrical Engineering, Linkoping, Sweden.
    17. 17)
      • Bayat-Sarmadi, S., Hasan, A.: ‘On concurrent detection of errors in polynomial basis multiplication’, available at: http://www.cacr.math.uwaterloo.ca/, 2006,CACR 2006-12.
    18. 18)
    19. 19)
    20. 20)
      • H. Fan , Y. Dai . Fast bit-parallel GF(2n) multiplier for all trinomials. IEEE Trans. Comput. , 485 - 490
    21. 21)
      • Skorobogatov, S.: ‘Semi-invasive attacks – a new approach to hardware security analysis’, University of Cambridge UCAM-CL-TR-630, available at: http://www.cl.cam.ac.uk/TechReports/, 2005,.
    22. 22)
      • C.-W. Chiou , C-Y. Lee , A.-W. Deng , J.-M. Lin . Concurrent error detection in Montgomery multiplication over GF(2m). IEICE Trans. Fundam. Electron., Commun. Comput. Sci. , 566 - 574
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds_20070184
Loading

Related content

content/journals/10.1049/iet-cds_20070184
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address