http://iet.metastore.ingenta.com
1887

Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m)

Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m)

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 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 Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Finite field arithmetic has been widely used in many cryptosystems, particularly in the elliptic curve cryptosystem (ECC) and the advanced encryption standard (AES) as a method for speeding up their encryption/decryption processes. Low-cost design for finite field arithmetic is more attractive for various mobile applications. It is a factor that a large number of Exclusive OR (XOR) gates have been used in the arithmetic operations under the traditional finite field arithmetic implementation. Thus, the cost of the traditional finite field arithmetic cannot be effectively lowered, because a typical XOR gate design consists of 12 transistors. To address this, a novel non-XOR approach consisting of eight transistors, for realising low-cost polynomial basis (PB) multiplier over GF(2m) was developed in this study. The authors proposed that non-XOR architecture for bit-parallel PB multiplier uses the multiplexer function instead of the traditional XOR function in its design. Based on the proposed non-XOR methodology, three popular low-cost irreducible polynomials – trinomial, pentanomial and all-one-polynomial – are proposed and designed in this study. The results indicate that the proposed non-XOR architecture can reduce space complexity by 22%, compared with that of the traditional design.

References

    1. 1)
      • F.J. MacWilliams , N.J.A. Sloane . (1977) The theory of error-correcting codes.
    2. 2)
      • R. Lidl , H. Niederreiter . (1994) Introduction to finite fields and their applications.
    3. 3)
    4. 4)
      • Miller, V.S.: `Use of elliptic curves in cryptography', Advances in Cryptology Crypto’85, 1986, p. 417–426, Springer-Verlag, (LNCS, 218).
    5. 5)
      • R.E. Blahut . (1985) Fast algorithms for digital signal processing.
    6. 6)
    7. 7)
    8. 8)
      • Mastrovito, E.D.: `VLSI architectures for multiplication over finite field ', Proc. Sixth Int. Conf., AAECC-6 Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, July 1988, Rome, p. 297–309.
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • Massey, J.L., Omura, J.K.: `Computational method and apparatus for finite field arithmetic', U.S. Patent Number 4,587,627, May 1986.
    18. 18)
      • Meher, P.K., Lee, C.-Y.: `Scalable serial-parallel multiplier over ', IEEE Int. Symp. Circuits and Systems, (ISCAS’09), May 2009, Taipei, Taiwan, p. 2910–2913.
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)
    28. 28)
    29. 29)
    30. 30)
    31. 31)
    32. 32)
    33. 33)
    34. 34)
    35. 35)
    36. 36)
    37. 37)
      • R.J. Baker . (2004) CMOS-circuit, design, layout, and simulation.
    38. 38)
    39. 39)
      • M74HC86: ‘Quad exclusive OR gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/2006.pdf.
    40. 40)
      • M74HC08: ‘Quad 2-input AND gate, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/1885.pdf.
    41. 41)
      • M74HC04 ‘Quad Inverter, 2001 STMicroelectronics’, http://www.st.com/stonline/products/literature/ds/1882/m74hc04.pdf.
    42. 42)
      • M74AC1157: ‘2 to 1 multiplexer, 2001 STMicroelectronics’, http://www.st.com/stonline/books/pdf/docs/5144.pdf.
    43. 43)
      • (2000) Digital signature standard.
    44. 44)
      • (2001) Announcing the advanced encryption standard (AES).
    45. 45)
    46. 46)
      • A. Menezes , I. Blake , X. Gao , R. Mullin , S. Vanstone , T. Yaghoobian . (1993) Applications of finite fields.
    47. 47)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2010.0139
Loading

Related content

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