Optimized and Scalable Co-Processor for McEliece with Binary Goppa Codes
Open Access
- 21 April 2015
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 14 (3) , 1-32
Abstract
Asymmetric cryptographic primitives are essential to enable secure communications in public networks or public mediums. Such primitives can be deployed as software libraries or hardware co-processors, the latter being more commonly employed in systems on chip (SoC) scenarios, embedded devices, or application-specific servers. Unfortunately, the most commonly available solutions, based on RSA or elliptic curve cryptography (ECC), are highly processing intensive due to the underlying extended-precision modular arithmetic. Consequently, they are not available on highly constrained platforms. Aiming to tackle this issue, we here investigate an alternative asymmetric encryption scheme that relies on lightweight arithmetic: McEliece. This scheme is especially appealing because, being based on error correction codes, it displays a simpler arithmetic and leads to better performance when compared to RSA or ECC. To evaluate the implementation of this scheme in hardware, we propose and analyze a flexible architecture whose security level and time versus area usage characteristics can be reconfigured as desired. The proposed architecture is suitable to all usual security levels, ranging from 80 to 256 bits. It is also very efficient, being able to perform data decryption with binary Goppa codes in 56µs with 3,402 slices on a Xilinx Spartan-3AN FPGA, whereas the best-known result in the literature for the same FPGA is 115µs with 7,331 slices. Alternatively, the architecture can operate with quasi-dyadic Goppa (QD-Goppa) codes, which involves smaller keys than traditional binary Goppa codes. In the latter case, for an 80-bit security level, the decryption operation can take from 1.1ms with 1,129 slices to 68µs with 8,268 sices. By choosing a more hardware-friendly decoding algorithm, focusing hardware resources on most bottleneck operations and sharing hardware resource for two different algorithms, better results than the those in the literature were obtained.Keywords
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (306935/2012-0)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (306935/2012-0)
This publication has 46 references indexed in Scilit:
- How to Maximize the Potential of FPGA-Based DSPs for Modular ExponentiationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
- Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decodingElectronics Letters, 2005
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystemsIEEE Transactions on Information Theory, 1994
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- On extending Goppa codes to cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1975
- The algebraic decoding of Goppa codesIEEE Transactions on Information Theory, 1975
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962
- Encoding and error-correction procedures for the Bose-Chaudhuri codesIEEE Transactions on Information Theory, 1960