This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem
November 2010 (vol. 59 no. 11)
pp. 1533-1546
Abdulhadi Shoufan, Center for Advanced Security Research Darmstadt CASED, Germany
Thorsten Wink, Technische Universität, Darmstadt, Germany
H. Gregor Molter, Technische Universität, Darmstadt, Germany
Sorin A. Huss, Technische Universität, Darmstadt, Germany
Eike Kohnert, Technische Universität, Darmstadt, Germany
The McEliece public-key cryptosystem relies on the NP-hard decoding problem, and therefore, is regarded as a solution for postquantum cryptography. Though early known, this cryptosystem was not employed so far because of efficiency questions regarding performance and communication overhead. This paper presents a novel processor architecture as a high-performance platform to execute key generation, encryption, and decryption according to this cryptosystem. A prototype of this processor is realized on a reconfigurable device and tested via a dedicated software interface. A comparison with a similar software solution highlights the performance advantage of the proposed hardware solution.

[1] R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
[2] N. Koblitz, "Elleptic Curve Cryptosystems," Math. Computation, vol. 48, pp. 203-209, 1987.
[3] C. McIvor, M. McLoone, and J. McCanny, "Hardware Elliptic Curve Cryptographic Processor over $rm GF(p)$ ," IEEE Trans. Circuits and Systems (ITCAS), vol. 53, no. 9, pp. 1946-1957, Sept. 2006.
[4] M. Hani, T. Lin, and N. Shaikh-Husin, "FPGA Implementation of RSA Public-Key Cryptographic Coprocessor," Proc. TENCON, pp. 6-11, 2000.
[5] P.W. Shor, "Algorithms for Quantum Computation: Discrete Logarithms and Factoring," Proc. 35th Ann. Symp. Foundation of Computer Science, 1994.
[6] R. Merkle, "A Certified Digital Signature," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '89), 1989.
[7] R.J. McEliece, "A Public Key Cryptosystem Based on Algebraic Coding Theory," DSN Progress Report 42-44, pp. 114-116, 1978.
[8] A. Lenstra, H.W. Lenstra, and L. Lovasz, "Factoring Polynomials with Rational Coefficients," Annals of Math., vol. 261, pp. 515-534, 1982.
[9] H. Fell and W. Diffie, "Analysis of a Public Key Approach Based on Polynomial Substitution," Advances in Cryptology-CRYPTO '85, Springer, 1986.
[10] A. Shoufan, O. Kelm, and S. Schipp, "A Novel Rekeying Message Authentication Procedure Based on Winternitz OTS and Reconfigurable Hardware Architectures," Proc. Int'l Conf. Reconfigurable Computing and FPGAs (ReConFig '08), 2008.
[11] S. Balasubramanian et al., "Fast Multivariate Signature Generation in Hardware: The Case of Rainbow," Proc. 19th IEEE Int'l Conf. Application-Specific Systems, Architectures and Processors (ASAP '08), 2008.
[12] M. El-Hadedy, D. Gligoroski, and S.J. Knapskog, "High Performance Implementation of a Public Key Block Cipher—MQQ, for FPGA Platforms," Proc. Int'l Conf. Reconfigurable Computing and FPGAs (ReConFig '08), 2008.
[13] J.-C. Beuchat, N. Sendrier, A. Tisserand, and G. Villard, "FPGA Implementation of a Recently Published Signature Scheme," Rapport de Recherche RR LIP 2004-14, 2004.
[14] S. Lin, Error Control Coding: Fundamentals and Applications. Prentice-Hall, 1983.
[15] F. Rodriguez-Henriques, N. Saqib, A. Perez, and C. Koc, Cryptographic Algorithms on Reconfigurable Hardware. Springer, 2006.
[16] V.D. Goppa, "A New Class of Linear Correcting Codes," Problems of Information Transmission, vol. 6, pp. 207-212, 1970.
[17] BNetzA "Algorithms for Qualified Electronic Signatures (in German)," http://www.bundesnetzagentur.de/media/archive 14953.pdf, 2010.
[18] D.J. Bernstein, T. Lange, and C. Peters, "Attacking and Defending the McEliece Cryptosystem," Post-Quantum Cryptography, pp. 31-46, Springer, 2008.
[19] D. Engelbert, R. Overbeck, and A. Schmidt, "A Summary of McEliece-Type Cryptosystems and Their Security," Math. Cryptology, vol. 1, pp. 151-191, 2007.
[20] D.J. Bernstein, J. Buchmann, and E. Damen, Post-Quantum Cryptography. Springer, 2009.
[21] K. Kobara and H. Imai, "Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC," Lecture Notes in Computer Science, pp. 19-35, Springer, 2001.
[22] N. Patterson, "Algebraic Decoding of Goppa Codes," IEEE Trans. Information Theory, vol. 21, no. 2, pp. 203-207, Mar. 1975.
[23] The Inst. of Electrical and Electronics Engineers, IEEE Standard Specifications for Public-Key Cryptography, 2000.
[24] B. Hochet, P. Quinton, and Y. Robert, "Systolic Gaussian Elimination over ${\hbox{\rlap{G}\kern 1.5pt{\hbox{G}}}}{\hbox{\rlap{F}\kern 1.5pt{\hbox{F}}}}(p)$ with Partial Pivoting," IEEE Trans. Computers, vol. 38, no. 9, pp. 1321-1324, Sept. 1989.
[25] J. Buchmann, Introduction to Cryptography (Undergraduate Texts in Mathematics). Springer, 2004.
[26] A. Menezes, P. Van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
[27] M. Ernst, M. Jung, F. Madlener, S.A. Huss, and R. Blümel, "A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF($2^n$ )," Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES '02), Aug. 2002.
[28] "Alpha-Data," http:/www.alpha-data.com, 2010.
[29] "Xilinx," http:/www.xilinx.com, 2010.
[30] T. Eisenbarth, T. Güneysu, S. Heyse, and C. Paar, "MicroEliece: McEliece for Embedded Devices," Proc. Workshop Cryptographic Hardware and Embedded Systems(CHES '09), 2009.

Index Terms:
Cryptography hardware and implementation, cryptoprocessor, McEliece cryptosystem, Goppa code, FPGA.
Citation:
Abdulhadi Shoufan, Thorsten Wink, H. Gregor Molter, Sorin A. Huss, Eike Kohnert, "A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem," IEEE Transactions on Computers, vol. 59, no. 11, pp. 1533-1546, Nov. 2010, doi:10.1109/TC.2010.115
Usage of this product signifies your acceptance of the Terms of Use.