Abstract
A low Hamming weight product (LHWP) exponent is used to increase the efficiency of cryptosystems based on the discrete logarithm problem (DLP). In this paper, we introduce a new tool, called a Parameterized Splitting System, to analyze the security of the DLP with LHWP exponents.
We apply a parameterized splitting system to attack the GPS identification scheme modified by Coron, Lefranc and Poupard in CHES’05 and obtain an algorithm of 261.6 time complexity which was expected to be 278. Also a parameterized splitting system can be used to solve the DLP with a LHWP exponent proposed by Hoffstein and Silverman in 254.51 time complexity, that is smaller than 259 in the recent Cheon-Kim attack.
Chapter PDF
Similar content being viewed by others
Keywords
References
Cheon, J., Kim, H.: Analysis of Low Hamming Weight Products; Discrete Applied Mathematics (to appear)
Coppersmith, D., Seroussi, G.: On the Minimum Distance of Some Quadratic Residue Codes. IEEE Trans. Inform. Theory 30, 407–411 (1984), MR 86c:94025
Coppersmith, D.: Private communication to Scott Vanstone (December 1997)
Coron, J., Lefranc, D., Poupard, G.: A New Baby-Step Giant-Step Algorithm and Some Application to Cryptanalysis. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 47–60. Springer, Heidelberg (2005)
Girault, M.: Self-Certified Public Keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)
Girault, M., Poupard, G., Stern, J.: Some Modes of Use of the GPS Identification Scheme. In: 3rd Nessie Conference, Springer, Heidelberg (November 2002)
Girault, M., Lefranc, D.: Public Key Authentication with One Single (on-line) Addition. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 413–427. Springer, Heidelberg (2004)
Heiman, R.: A Note on Discrete Logarithms with Special Structure. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 454–457. Springer, Heidelberg (1993)
Hoffstein, J., Silverman, J.: Random Small Hamming Weight Products with Application to Cryptography. Discrete Appl. Math. 130(1), 37–49 (2003)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, p. 128. CRC Press, Boca Raton (1997)
Pollard, J.: Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation 32(143), 918–924 (1978)
Poupard, G., Stern, J.: Security Analysis of a Practical “On the Fly” Authentication and Signature Generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 422–436. Springer, Heidelberg (1998)
Shanks, D.: Class Number, a Theory of Factorization and Genera. Proc. Symp. Pure Math. 20, 415–440 (1971)
Shoup, V.: Lower Bounds for discrete Logarithms and Related Problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256–266. Springer, Heidelberg (1997)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
Stinson, D.: Some Baby-Step Giant-Step Algorithms for the Low Hamming Weight Discrete Logarithm Problem. Mathematics of Computation 71(237), 379–391 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Cheon, J.H. (2008). A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents. In: Cramer, R. (eds) Public Key Cryptography – PKC 2008. PKC 2008. Lecture Notes in Computer Science, vol 4939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78440-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-78440-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78439-5
Online ISBN: 978-3-540-78440-1
eBook Packages: Computer ScienceComputer Science (R0)