research-article

LSM: Novel Low-Complexity Unified Systolic Multiplier over Binary Extension Field

Authors:

Jiafeng Xie,

Chiou-Yng LeeAuthors Info & Claims

GLSVLSI '19: Proceedings of the 2019 Great Lakes Symposium on VLSI

Pages 343 - 346

https://doi.org/10.1145/3299874.3318033

Published: 13 May 2019 Publication History

Get Access

Abstract

Unified (hybrid field-size) systolic multiplier over GF(2m) (binary extension field) has attracted significant attentions from research communities recently as it can be used in reconfigurable cryptographic processors. In this paper, we present a novel Low-complexity unified Systolic Multiplier (LSM) design strategy to address the above mentioned challenge. First, a novel multiplication algorithm for unified implementation is proposed first with detailed mathematical derivation. Then, an efficient systolic structure is then presented based on the proposed algorithm (with the help of several mapping techniques). Finally, a thorough complexity analysis is given to verify the superior performance of the proposed design (the proposed structure involves better complexities than the newly reported design).

References

[1]

Haining et al. Fan. 2007. A new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Trans. Computers 56, 2 (2007), 224--233.

Digital Library

Google Scholar

[2]

FIPS. 2000. 186-2. Digital Signature Standard. US Department of Commerce/National Institute of Standards and Technology.

Google Scholar

[3]

Kwiat, G, and Gauthier, J. 2017. Reconfigurable Free-Space Quantum Cryptography System. US Patent App. 15/434,313.

Google Scholar

[4]

Qiliang et al. Shao. 2018. Low Complexity Implementation of Unified Systolic Multipliers for NIST Pentanomials and Trinomials Over GF(2m). IEEE TCASI 65, 8 (2018), 2455--2465.

Google Scholar

[5]

Nangate standard cell library. {n. d.}. {Online}. Available: http://www.si2.org/openeda.si2.org/projects/nangatelib.

Google Scholar

[6]

Jiafeng et al. Xie. 2013. Low latency systolic Montgomery multiplier for finite field GF(2m) based on pentanomials. IEEE Trans. VLSI Systems 21, 2 (2013), 385--389.

Digital Library

Google Scholar

[7]

Yiqun et al. Zhang. 2017. Recryptor: A reconfigurable in-memory cryptographic Cortex-M0 processor for IoT. In VLSI Circuits, 2017 Symposium on. IEEE, C264--C265

Google Scholar

Cited By

View all

Lee CXie JCheng KYang H(2020)Efficient Subquadratic Space Complexity Digit-Serial Multipliers over GF(2) based on Bivariate Polynomial Basis RepresentationProceedings of the 25th Asia and South Pacific Design Automation Conference10.1109/ASP-DAC47756.2020.9045615(253-258)Online publication date: 17-Jan-2020
https://dl.acm.org/doi/10.1109/ASP-DAC47756.2020.9045615

Index Terms

LSM: Novel Low-Complexity Unified Systolic Multiplier over Binary Extension Field
1. Computer systems organization
  1. Dependable and fault-tolerant systems and networks
    1. Redundancy
  2. Embedded and cyber-physical systems
    1. Embedded systems
    2. Robotics
2. Networks
  1. Network properties
    1. Network reliability

Recommendations

Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/)
Special issue on computer arithmetic

A systolic structure for bit-serial division over the field GF(2/sup m/) is developed. Consideration is given to avoid global data communications and dependency of the time step duration on m. This is important for applications where the value of m is ...
An Efficient Look-up Table-based Approach for Multiplication over GF(2m) Generated by Trinomials

In this paper, we present an efficient look-up table (LUT)-based approach to design multipliers for GF(2m) generated by irreducible trinomials. A straightforward LUT-based multiplication requires a table of size (m 2m) bits for the Galois field of ...
Analysis of Systolic Penalties and Design of Efficient Digit-Level Systolic-like Multiplier for Binary Extension Fields

Systolic designs are considered as suitable candidate for high-speed VLSI realization for their inherent advantages of simplicity, regularity, modularity, and local interconnections. During the past few decades several systolic designs of finite field ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GLSVLSI '19: Proceedings of the 2019 Great Lakes Symposium on VLSI

May 2019

562 pages

ISBN:9781450362528

DOI:10.1145/3299874

General Chairs:
Houman Homayoun
George Mason University, USA
,
Baris Taskin
Drexel University, USA
,
Program Chairs:
Tinoosh Mohsenin
UMBC, USA
,
Weisheng Zhao
Beihang University, China

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 May 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Villanova Internal Fund

Conference

GLSVLSI '19

Sponsor:

SIGDA

GLSVLSI '19: Great Lakes Symposium on VLSI 2019

May 9 - 11, 2019

VA, Tysons Corner, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
47
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lee CXie JCheng KYang H(2020)Efficient Subquadratic Space Complexity Digit-Serial Multipliers over GF(2) based on Bivariate Polynomial Basis RepresentationProceedings of the 25th Asia and South Pacific Design Automation Conference10.1109/ASP-DAC47756.2020.9045615(253-258)Online publication date: 17-Jan-2020
https://dl.acm.org/doi/10.1109/ASP-DAC47756.2020.9045615

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/)

An Efficient Look-up Table-based Approach for Multiplication over GF(2m) Generated by Trinomials

Analysis of Systolic Penalties and Design of Efficient Digit-Level Systolic-like Multiplier for Binary Extension Fields