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

Low-complexity unidirectional systolic Dickson basis multiplier for lightweight cryptosystems

Low-complexity unidirectional systolic Dickson basis multiplier for lightweight cryptosystems

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

Thank you

Your recommendation has been sent to your librarian.

Finite field multiplier is a very important operation for realising elliptic curve cryptography. Dickson basis is a recently developed basis for representing finite elements in GF(2 m ). This study will propose a unidirectional systolic multiplier for such Dickson basis. The unidirectional systolic structure offers low space and time complexities and can be easily modified to have error detection capability which can resist side-channel attacks.

References

    1. 1)
      • 1. Miller, V.S.: ‘Use of elliptic curves in cryptography’, in Williams, H.C. (Ed.): Advances in Cryptology – CRYPTO '85 Proceedings: Lecture Notes in Computer Science Vol 218 (Springer, Berlin & Heidelberg, 1986), pp. 417426.
    2. 2)
    3. 3)
    4. 4)
      • 4. Deschamps, J.-P., Imaña, J.L., Sutter, G.D.: ‘Hardware implementation of finite-field arithmetic’ (McGraw-Hill Press, New York, 2009).
    5. 5)
      • 5. Kwon, S.: ‘A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of type II’. Proc. of the 16th IEEE Symp. on Computer Arithmetic, Santiago de Compostela, Spain, 15–18 June 2003, pp. 196202.
    6. 6)
    7. 7)
      • 7. ANSI X9.62-2005: ‘Public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA)’, American National Standards Institute (ANSI), November 2005.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • 11. Schimidt, J., Medwed, M.: ‘A fault attack on ECDSA’. Proc. 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), Lausanne, Switzerland, 6–6 September 2009, pp. 9399.
    12. 12)
      • 12. NanGate Standard Cell Library. Available at http://www.si2.org/openeda.si2.org/projects/nangatelib/, accessed 17 September 2017.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2018.6235
Loading

Related content

content/journals/10.1049/el.2018.6235
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address