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

Squaring architecture for GF(2m) and its applications in cryptographic systems

Squaring architecture for GF(2m) and its applications in cryptographic systems

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:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A squaring architecture for standard basis field representation is presented. The architecture is based on the observation that a squaring operation in GF(2m) can be transformed into an addition and a multiplication of two elements of special form, the computational time of which depends on the form of the field polynomial.

Inspec keywords: polynomials; multiplying circuits; cryptography

Other keywords: squaring architecture; multiplication; addition; field polynomial; GF(2m); standard basis field representation; cryptographic systems; computational time

Subjects: Cryptography theory; Cryptography

References

    1. 1)
      • R. Lidl , H. Niederreiter . (1983) Finite fields, Encyclopedia of mathematics and its applications, Vol. 20.
    2. 2)
      • Wu, H.: `Low complexity bit-parallel finite field arithmetic using polynomialbasis', Workshop on cryptographic hardware and embedded systems(CHES '99), August 1999, LNCS 1717, Springer-Verlag.
    3. 3)
      • A. X9.62-199x, ‘Public key cryptography for the financialservicesindustry:The elliptic curve digital signature algorithm (ECDSA)’.January 1998. Approved January 7, 1999.
    4. 4)
      • L. Song , K.K. Parhi . Low-energy digit-serial/parallel finite field multipliers. J. VLSI Sig. Process. Syst. , 22 , 1 - 17
    5. 5)
      • S.K. Jain , L. Song , K.K. Parhi . Efficient semisystolic architectures for finite-fields arithmetic. IEEE Trans. VLSI Syst. , 101 - 113
    6. 6)
      • C. Paar , P. Fleischmann , P. Soria-Rodriguez . Fast arithmetic for public-key algorithms in Galois fields with compositeexponents. IEEE Trans. , 1025 - 1034
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20000824
Loading

Related content

content/journals/10.1049/el_20000824
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address