Efficient linear array for multiplication over NIST recommended binary fields

Soonhak Kwon, Taekyoung Kwon, Young Ho Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m), m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve cryptography.

Original languageEnglish
Title of host publicationFuzzy Logic and Applications - 6th International Workshop, WILF 2005, Revised Selected Papers
Pages427-436
Number of pages10
DOIs
Publication statusPublished - 2006
Event6th International Workshop - Fuzzy Logic and Applications - Crema, Italy
Duration: 2005 Sep 152005 Sep 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3849 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Workshop - Fuzzy Logic and Applications
CountryItaly
CityCrema
Period05/9/1505/9/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient linear array for multiplication over NIST recommended binary fields'. Together they form a unique fingerprint.

  • Cite this

    Kwon, S., Kwon, T., & Park, Y. H. (2006). Efficient linear array for multiplication over NIST recommended binary fields. In Fuzzy Logic and Applications - 6th International Workshop, WILF 2005, Revised Selected Papers (pp. 427-436). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3849 LNAI). https://doi.org/10.1007/11676935_53