QC-MDPC McEliece: an Optimized Implementation of a New McEliece Variant

Homero Oliveira Martins, Anderson A. C. Nascimento

Abstract


This paper presents the implementation of an optimized version of a McEliece variant.The McEliece cryptosystem is an example of code-based cryptography which is an alternative to the most popular and commercial cryptosystems nowadays as it is believed to be immune to quantum computing. It has simple and fast algorithms, but its drawback is the size of the keys it has to deal with. By substituting the Goppa codes of the McEliece original proposalby LDPC and MDPC codes it’s possible to achieve much smaller keys. And by applying programming technicssuch as parallelization of operations and also utilizing efficient decoders of LDPC codes it’s possible to achieve really good results and optimal performances of the code-based cryptosystem showing that it really has to be considered as a strong substitute to RSA and DSA as quantum computers emerge to easily compute discrete logarithms and factor large integers. 


Keywords


Post-quantum cryptography; Cryptography; Coding-theory; Efficient decoding

References


D. J. Bernstein, J. Buchmann, and E. Dahmen, editors. Post-Quantum Cryptography. Springer-Verlag, 2009.

R. J. McEliece, “A Public-Key Cryptosystem Based On Algebraic Coding Theory”, Deep Space Network Progress Report, vol. 44, pp. 114–116, Jan. 1978.

R. Misoczki, J.-P. Tillich, N. Sendrier, and P. S. L. M. Barreto, “MDPC- McEliece: New McEliece Variants from Moderate Density Parity-Check Codes”, IEEE International Symposium on Information Theory, vol. 2013, 2013.

I. von Maurich, T. Güneysu,“Lightweight Code-based Cryptography: QC-MDPC McEliece Encryption on Reconfigurable Devices”, Procedings of the IEE Design, Automation and Test in Europe Conference and Exhibition (DATE), 2014, pp. 1-6.

S. Heyse, I. von Maurich, and T. Güneysu, “Smaller Keys for Code- Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices”, in CHES, ser. Lecture Notes in Computer Science, G. Bertoni and J.-S. Coron, Eds., vol. 8086. Springer, 2013, pp. 273– 292.

R. Gallager, “Low-density Parity-check Codes”, Information Theory, IRE Transactions on, vol. 8, no. 1, pp. 21–28, 1962.

Meschach: Matrix computations in C. Disponível em: Acesso em 20 de maio de 2014.

R. P. Jasinski, V. A. Pedroni, A. Gortan, W. Godoy Jr, “An Improved GF(2) Matrix Inverter with Linear Time Complexity”, Procedings of the IEE International Conference on Reconfigurable Computing and FPGAs (ReConFig), 2010, pp. 322-327.

Intel IntrinsicsGuide. Disponível em: Acesso em 20 de maio de 2014.

W. C. Huffman and V. Pless, “Fundamentals of Error-Correcting Codes”, 2010.




DOI: https://doi.org/10.17648/enig.v1i1.20

Refbacks

  • There are currently no refbacks.




Licença Creative Commons
This site is licensed with the Creative Commons Atribuição-NãoComercial-SemDerivações 4.0 Internacional

RENASIC Logo1 Logo2 Logo3