© The Institution of Engineering and Technology
Faultbased sidechannel cryptanalysis is a useful technique against symmetrical and asymmetrical encryption/decryption algorithms. Thus, eliminating cryptographic computation errors become critical in preventing such kind of attacks. A simple way to eliminating cryptographic computation errors is to output correct or corrected ciphers. Multiplication is the most important finite field arithmetic operation in the cryptographic computations. By using time redundancy technique, a novel dual basis (DB) multiplier over Galois fields (2^{m}) will be presented with lower space complexity and feedbackfree property. Based on the proposed feedbackfree DB multiplier, the DB multiplier with a concurrent error detection (CED) capability is also easily developed. Compared with the existing DB multiplier with CED capability, the proposed one saves about 90% of timearea complexity. No existing DB multiplier in the literature has concurrent error correction (CEC) capability. Based on the proposed DB multiplier, a novel DB multiplier with CEC capability is easily designed. The proposed DB multiplier with CEC capability requires only about 3% of extra space complexity and 15% of time complexity when compared with the proposed DB multiplier without CEC.
References


1)

The theory of errorcorrecting codes

2)

Introduction to finite fields and their applications

3)

Fast algorithms for digital signal processing

4)

The use of finite fields to compute convolutions

5)

Galois switching functions and their applications

6)

A VLSI design for computing exponentiation in GF(2m) and its application to generate pseudorandom number sequences

7)

Bitserial ReedSolomon encoder

8)

Efficient bitserial multiplication and the discretetime WienerHopf equation over finite fields

9)

Computation with finite fields

10)

Mastrovito, E.D., Mora, T.: `VLSI architectures for multiplication over finite field GF(2', Proc. 6th Int. Conf., AAECC6, July 1988, Rome, p. 297–309

11)

Mastrovito, E.D.: `VLSI architectures for computations in Galois fields', 1991, PhD, Linköping University, Department of Electrical Engineering, Linköping, Sweden, 1991

12)

Lowcomplexity bitparallel canonical and normal basis multipliers for a class of finite fields

13)

Structure of parallel multipliers for a class of fields GF(2m)

14)

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)

15)

Bitparallel systolic multipliers for GF(2m) fields defined by allone and equallyspaced polynomials

16)

Bitparallel finite field multiplier and squarer using polynomial basis

17)

Efficient systolic arrays for powersum, inversion, and division in GF(2m)

18)

Scalable and systolic architecture for computing double exponentiation over GF(2m)

19)

Lowcomplexity bitparallel systolic architectures for computing A(x)B2(x) over GF(2m)

20)

Unified parallel systolic multipliers over GF(2m)

21)

Massey, J.L., Omura, J.K.: `Computational method and apparatus for finite field arithmetic', U.S., 4,587,627, 1986

22)

VLSI architectures for computing multiplications and inverses in GF(2m)

23)

A new construction of MasseyOmura parallel multiplier over GF(2m)

24)

Efficient normal basis multipliers in composite fields

25)

An efficient optimal normal basis type II multiplier

26)

A fast algorithm for multiplicative inversion in GF(2m) using normal basis

27)

Efficient design of lowcomplexity bitparallel systolic Hankel multipliers to implement multiplication in normal and dual bases of GF(2m)

28)

Multiplexerbased doubleexponentiation for normal basis of GF (2m)

29)

A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases

30)

New lowcomplexity bitparallel finite field multipliers using weakly dual bases

31)

Low complexity bitparallel multipliers for a class of finite fields

32)

GF(2m) multiplication and division over the dual basis

33)

An algorithm to design finite field multipliers using a selfdual normal basis

34)

Dual basis systolic multipliers for GF(2m)

35)

Bit serial multiplication in finite fields

36)

New bitserial systolic multiplier for GF(2m) using irreducible trinomials

37)

Boneh, D., DeMillo, R., Lipton, R.: `On the importance of checking cryptographic protocols for faults', Proc. Eurocrypt, 1999, p. 37–51, Springer LNCS 1233

38)

Biham, E., Shamir, A.: `Differential fault analysis of secret key cryptosystems', Proc. Crypto, 1997, p. 513–525, Springer LNCS 1294

39)

Kelsey, J., Schneier, B., Wagner, D., Hall, C.: `Sidechannel cryptanalysis of product ciphers', Proc. ESORICS, September 1998, Springer, p. 97–110

40)

Anderson, R.J., Kuhn, M.: `Low cost attack on tamper resistant devices', Proc. 5th Int. Workshop on Security Protocols, 1997, Lecture Notes in Computer Sciences, SpringerVerlag, LNCS 1361

41)

Messerges, T.S., Dabbish, E.A., Sloan, R.H.: `Power analysis attacks on modular exponentiation in smartcards', Proc. Cryptographic Hardware and Embedded Systems (CHES'99), LNCS 1717, 1999

42)

Coron, J.S.: `Resistance against differential power analysis attacks for elliptic curve cryptosystems', Proc. Cryptographic Hardware and Embedded Systems (CHES'99), LNCS 1717, 1999, p. 292–302

43)

Karri, R., Kuznetsov, G., Goessel, M.: `Paritybased concurrent error detection of substitutionpermutation network block ciphers', Proc. CHES 2003, 2003, Springer LNCS 2779, p. 113–124

44)

Error analysis and detection procedures for a hardware implementation of the advanced encryption standard

45)

Chinese remaindering based cryptosystems in the presence of faults

46)

On the importance of eliminating errors in cryptographic computations

47)

Online error detection for bitserial multipliers in GF(2m)

48)

ReyhaniMasoleh, A., Hasan, M.A.: `Error detection in polynomial basis multipliers over binary extension fields', Proc. Cryptographic Hardware and Embedded SystemsCHES 2002, LNCS 2523, 2003, p. 515–528

49)

Fault detection architectures for field multiplication using polynomial bases

50)

Concurrent error detection in a bitparallel systolic multiplier for dual basis of GF(2m)

51)

Concurrent error detection in array multipliers for GF(2m) fields

52)

Concurrent error detection in a polynomial basis multiplier over GF(2m)

53)

Concurrent error detection in montgomery multiplication over GF(2m)

54)

Concurrent error detection in ALU's by recomputing with shifted operands

55)

Concurrent error detection in multiply and divide arrays

56)

Minero, R.H., Anello, A.J., Furey, R.G., Palounek, L.R.: `Checking by pseuduplication', U.S., 3660646, May 1972

57)

National Institute for Standards and Technology, ‘Digital Signature Standard’, FIPS publication 1862, January 2000

58)

Hewlett Packard: ‘Table of lowweight binary irreducible polynomials’, HPL98135, 1998

59)

Principles of CMOS VLSI design: a system perspective

60)

M74HC86: ‘Quad exclusive OR gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/2006.pdf

61)

M74HC08: ‘Quad 2input AND gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/1885.pdf

62)

M74HC174: ‘Hex Dtype flip flop with clear, 2001 STMicroelectronics’, http://www.st.com/stonline/products/literature/ds/1914/M74HC174.pdf

63)

M74HC32: ‘Quad 2input OR gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/1944.pdf

64)

M74HC4075: ‘Triple 3input OR gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/1970.pdf

65)

Error detecting codes, selfchecking circuits and applications

66)

VLSl architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m)
http://iet.metastore.ingenta.com/content/journals/10.1049/ietcds_20080122
Related content
content/journals/10.1049/ietcds_20080122
pub_keyword,iet_inspecKeyword,pub_concept
6
6