FPGA Implementation of Encryption Algorithms Based on Residual Polynomials

Maksat Kalimoldayev, Sakhybay Tynymbayev, Miras Magzom, Dana Tananova, Sergey Edward Lyshevski

2020

Closed access Metadata (CSL-JSON)
DOI 10.1109/elnano50318.2020.9088890
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This paper describes an encryption algorithm based on a polynomial system of residual classes. We study the FPGA bitstream implementation on the Xilinx and 16-nm UltraScale™ ASIC architecture which enables floating-point operation, multi-processing, parallelism, pipelining, highperformance computing, etc. The software-based bitstream encryption and on-chip decryption are performed with the stored encryption key and encrypted bitstream, generated by a Vivado tool. The self-authenticating algorithms with a symmetric key are investigated. The encryption algorithms are implemented using the polynomial system of residual numbers. Data encryption in a residual number system is effectively implemented by ASICs. Design of irreducible polynomial is proposed and discussed. Our developments and findings are empowered by the low-power FinFET FPGA architecture.