Abstract
In this article we discus a probability problem applied in the code based cryptography. It is related to the shape of the polynomials with exactly t different roots. We will show that the structure is very dense and the probability that this type of polynomials has at least one coefficient equal to zero is extremelly low. We treated this issue in our research of natural countermeasures to a timing attack against the polynomial evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avanzi, R., Hoerder, S., Page, D., Tunstall, M.: Side-channel attacks on the McEliece and Niederreiter public-key cryptosystems. In: Cryptology ePrint Archive, Report 2010/479 (2010)
Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer (2009)
Bernstein, D.J., Chou, T., Schwabe, P.: McBits: fast constant-time code-based cryptography, 0616 (2013)
Bernstein, D.J., Lange, T., Peters, C.: Wild MCEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 143–158. Springer, Heidelberg (2011)
Bernstein, D.J., Lange, T., Peters, C.: Wild MCEliece incognito. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 244–254. Springer, Heidelberg (2011)
Biswas, B., Sendrier, N.: McEliece cryptosystem implementation: Theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 47–62. Springer, Heidelberg (2008)
Cayrel, P.-L., Hoffmann, G., Persichetti, E.: Efficient implementation of a CCA2-secure variant of MCEliece using generalized Srivastava codes. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 138–155. Springer, Heidelberg (2012)
Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a MCEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157–174. Springer, Heidelberg (2001)
Eisenbarth, T., Güneysu, T., Heyse, S., Paar, C.: MicroEliece: McEliece for embedded devices. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 49–64. Springer, Heidelberg (2009)
Heyse, S.: Implementation of McEliece based on Quasi-dyadic Goppa Codes for Embedded Devices. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 143–162. Springer, Heidelberg (2011)
Heyse, S.: Low-reiter: Niederreiter encryption scheme for embedded microcontrollers. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 165–181. Springer, Heidelberg (2010)
Heyse, S., von Maurich, I., Guneysu, T.: Smaller Keys for Code-based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices (2013)
Landais, G., Sendrier, N.: CFS Software Implementation. Indocrypt 2012 and Cryptology ePrint Archive, Report 2012/132 (2012)
Massey, J.L.: Shift-register synthesis and bch decoding. Transactions on Information Theory IT-15(1), 122–127 (1969)
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: Jet Propulsion Laboratory DSN Progress Report 42-44, pp. 114–116 (1978)
Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: Mdpc-McEliece: New McEliece variants from moderate density parity-check codes. In: Cryptology ePrint Archive, Report 2012/409 (2012)
Patterson, N.J.: The algebraic decoding of goppa codes. IEEE Transactions on Information Theory IT-21, 203–207 (1975)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer (1994)
Shoufan, A., Strenzke, F., Molter, H.G., Stöttinger, M.: A Timing Attack against Patterson Algorithm in the McEliece PKC. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 161–175. Springer, Heidelberg (2010)
Strenzke, F.: A Timing Attack against the Secret Permutation in the McEliece PKC. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 95–107. Springer, Heidelberg (2010)
Strenzke, F.: Timing attacks against the syndrome inversion in code-based cryptosystems. In: Cryptology ePrint Archive, Report 2011/683 (2011)
Strenzke, F., Tews, E., Molter, H.G., Overbeck, R., Shoufan, A.: Side channels in the mcEliece PKC. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 216–229. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Dragoi, V., Cayrel, PL., Colombier, B., Richmond, T. (2013). Polynomial Structures in Code-Based Cryptography. In: Paul, G., Vaudenay, S. (eds) Progress in Cryptology – INDOCRYPT 2013. INDOCRYPT 2013. Lecture Notes in Computer Science, vol 8250. Springer, Cham. https://doi.org/10.1007/978-3-319-03515-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-03515-4_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03514-7
Online ISBN: 978-3-319-03515-4
eBook Packages: Computer ScienceComputer Science (R0)