Abstract
Research within “post-quantum” cryptography has focused on development of schemes that resist quantum cryptanalysis. However, if such schemes are to be deployed, practical questions of efficiency and physical security should also be addressed; this is particularly important for embedded systems. To this end, we investigate issues relating to side-channel attack against the McEliece and Niederreiter public-key cryptosystems, for example improving those presented by Strenzke et al. (Side channels in the McEliece PKC, vol. 5299, pp. 216–229, 2008), and novel countermeasures against such attack.
Similar content being viewed by others
References
Avanzi, R.: Another look at square roots (and other less common operations) in fields of even characteristic. In: Proceedings of SAC 2007. LNCS, vol. 4876, pp. 138–154. Springer. Berlin (2007)
Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Proceedings of PQCrypto 2008. LNCS, vol. 5299, pp. 31–46, Springer, Berlin 2008. See also: Cryptology ePrint Archive, Report 2008/318 (2008). http://eprint.iacr.org/2008/318.pdf
Biswas, B., Sendrier, N.: McEliece cryptosystem implementation: theory and practice. In: Proceedings of PQCrypto 2008. LNCS, vol. 5299, pp. 47–62. Springer, Heidelberg (2008)
Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. Cryptology ePrint Archive, Report 2001/010 (2001). http://eprint.iacr.org/2001/010.pdf
Eisenbarth, T., Güneysu, T., Heyse, S., Paar, C.: MicroEliece: McEliece for embedded devices. In: Cryptographic Hardware and Embedded Systems (CHES), LNCS, vol. 5747, pp. 49–64. Springer, Berlin (2009)
Fong K., Hankerson D., López J., Menezes A.: Field inversion and point halving revisited. IEEE Trans. Comput. 53(8), 1047–1059 (2004)
Gauthier Umaña, V., Leander, G.: Practical key recovery attacks on two McEliece variants. http://eprint.iacr.org/2009/509.pdf
Faugère, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Advances in Cryptology—EUROCRYPT 2010. LNCS, vol. 6110, pp. 279–298. Springer, Berlin (2010). http://www-salsa.lip6.fr/~jcf/Papers/Eurocrypt2010.pdf
Heyse, S., Moradi, A., Paar, C.: Practical power analysis attacks on software implementations of McEliece. In: Proceedings of PQCrypto 2010, LNCS, vol. 6061, pp. 165–181. Springer, Berlin (2010)
Huber, K.: Note on decoding binary Goppa codes. In: Electronics Letters, vol. 32, no. 2, pp. 102–103 (1996). http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=490862&isnumber=10460
Hoerder, S.: Explicit computational aspects of McEliece encryption schemes. Diploma Thesis. Ruhr-Universität Bochum (2009)
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Jet Propulsion Laboratory DSN Progress Report 42–44, January and February 1978, pp. 114-116. http://ipnpr.jpl.nasa.gov/progress_report2/42-44/44N.PDF
Merkle, R.: A certified digital signature. In: Advances in Cryptology—CRYPTO’89, LNCS 1462, pp. 218–238. Springer, Berlin (1989)
Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory (Problemy Upravlenija i Teorii Informacii) 15, 159–166 (1986)
Patterson N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21/2, 203–207 (1975)
Proos J., Zalka C.: Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3, 317–344 (2003)
Sendrier, N.: Encoding information into constant weight words. In: Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, pp. 435–438. Springer, Berlin (2005)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: Foundations of Computer Science, IEEE Computer Society Press, pp. 124–134, 1994. Extended version: SIAM Journal on Computing, vol. 26, pp. 1484–1509 (1997)
Shoufan, A., Strenzke, F., Molter, H.G., Stöttinger, M.: A timing attack against Patterson algorithm in the McEliece PKC. In: Proceedings of ICISC 2009, LNCS, vol. 5984, pp. 161–175. Springer, Berlin (2010)
Shoup, V.: NTL—a library for doing numbery theory, v. 5.4.1. (2007). http://www.shoup.net/ntl/
Sidel’nikov V.M., Shestakov S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discret. Math. Appl. 2(4), 439–444 (1992)
Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: A method for solving key equation for decoding Goppa codes. In: Information and Control, vol. 27, pp. 87–99 (1975)
Strenzke, F., Tews, E., Molter, H.G., Overbeck, R., Shoufan, A.: Side channels in the McEliece PKC. In: Proceedings of PQCrypto 2008, LNCS, vol. 5299, pp. 216–229. Springer, Berlin (2008)
Strenzke, F.: A timing attack against the secret permutation in the McEliece PKC. In: Proceedings of PQCrypto 2010, LNCS, vol. 6061, pp. 95–107. Springer, Berlin (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research described in this paper was conducted while the first author was a member of the Faculty of Mathematics, Ruhr-University Bochum, Germany. This work has been supported in part by EPSRC grants EP/H001689/1 and EP/F039638/1.
An erratum to this article can be found at http://dx.doi.org/10.1007/s13389-011-0026-7
Rights and permissions
About this article
Cite this article
Avanzi, R., Hoerder, S., Page, D. et al. Side-channel attacks on the McEliece and Niederreiter public-key cryptosystems. J Cryptogr Eng 1, 271–281 (2011). https://doi.org/10.1007/s13389-011-0024-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13389-011-0024-9