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

On the use of Karatsuba formula to detect errors in GF((2n)2) multipliers

On the use of Karatsuba formula to detect errors in GF((2n)2) multipliers

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

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

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.

© The Institution of Engineering and Technology
Published

Galois fields are widely used in cryptographic applications. The detection of an error caused by a fault in a cryptographic circuit is important to avoid undesirable behaviours of the system that could be used to reveal secret information. One of the methods used to avoid these behaviours is the concurrent error detection. Multiplication in finite field is one of the most important operations and is widely used in different cryptographic systems. The authors propose in this study an error-detection method for composite finite-field multipliers based on the use of Karatsuba formula. The Karatsuba formula can be used in GF((2n)2) field to decrease the hardware complexity of the finite-field multiplier. The authors propose a novel finite-field multiplier with concurrent error-detection capabilities based on the Karatsuba formula. How the error-detection capabilities of this multiplier are able to face a wide range of fault-based attacks is also shown.

Inspec keywords: Galois fields; error detection; cryptography; multiplying circuits

Other keywords: GF((2n)2) multipliers; concurrent error detection method; Karatsuba formula; cryptographic systems; hardware complexity; Galois fields; composite finite-field multipliers; cryptographic circuit; fault-based attacks; finite field multiplication

Subjects: Logic and switching circuits; Cryptography; Codes; Logic circuits; Data security

References

    1. 1)
    2. 2)
      • A. Karatsuba , Y. Ofman . Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk SSSR , 293 - 294
    3. 3)
    4. 4)
    5. 5)
      • Bayat-Sarmadi, S., Hasan, M.A.: `Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme', Proc. 20th IEEE Int. Symp. on Defect and Fault Tolerance in VLSI Systems, DFT'05, October 2005, p. 102–110.
    6. 6)
    7. 7)
    8. 8)
      • Touba, N.A., McCluskey, E.J.: `Logic synthesis techniques for reduced area implementation of multilevel circuits with concurrent error detection', Proc. 1994 IEEE/ACM Int. Conf. on Computer-Aided Design, 1994, p. 651–654.
    9. 9)
      • Hariri, A., Reyhani-Masoleh, A.: `Fault detection structures for the Montgomery multiplication over binary extension fields', Proc. Fourth Int. Workshop on Fault Diagnosis and Tolerance in Cryptography, 2007, FDTC'07, 10 September 2007, Vienna, Austria, p. 37–46.
    10. 10)
    11. 11)
    12. 12)
      • P.K. Lala . (2001) Self-checking and fault-tolerant digital design.
    13. 13)
      • Bolchini, C., Salice, F., Sciuto, D.: `A novel methodology for designing TSC networks based on the parity bit code', European Design and Test Conf., ED&TC 97, 17–20 March 1997, p. 440–444.
    14. 14)
      • Paar, C.: `Efficient VLSI architectures for bit-parallel computation in Galois fields', June 1994, PhD, Institute for Experimental Mathematics, University of Essen, Essen, Germany, (English translation).
    15. 15)
    16. 16)
    17. 17)
      • L.-T. Wang , C.-W. Wu , X. Wen . (2006) VLSI test principles and architectures: design for testability.
    18. 18)
      • Mozaffari Kermani, M., Reyhani-Masoleh, A.: `Parity prediction of s-box for AES', Proc. Canadian Conf. on Electrical and Computer Engineering, CCECE 2006, 2006, p. 2357–2360.
    19. 19)
      • Gaubatz, G., Sunar, B.: `Robust finite field arithmetic for fault-tolerant public-key cryptography', Proc. Third Int. Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC'06, 2006, p. 196–210.
    20. 20)
    21. 21)
      • Mozaffari Kermani, M., Reyhani-Masoleh, A.: `A structure-independent approach for fault detection hardware implementations of the advanced encryption standard', Fourth Int. Workshop on Fault Diagnosis and Tolerance in Cryptography, 2007, FDTC 2007, 10 September 2007, Vienna, Austria.
    22. 22)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds.2011.0278
Loading

Related content

content/journals/10.1049/iet-cds.2011.0278
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address