Generic algorithm for small weight discrete logarithms in composite groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8781, Issue , 2014, Pages 278-289

  May, Alexander ^a   Ozerov, Ilya ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Cryptanalysis; Generic discrete logarithm; Representations; Small hamming weight

Indexed keywords

COMPUTER PROGRAMMING; CRYPTOGRAPHY;

CRYPTANALYSIS; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; ENTROPY FUNCTION; GENERIC ALGORITHM; HAMMING WEIGHTS; MEET-IN-THE-MIDDLE; REPRESENTATIONS;

ALGORITHMS;

EID: 84918584622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-13051-4_17     Document Type: Conference Paper

References (14)

1. Adleman, L.M.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography (abstract). In: FOCS, pp. 55-60. IEEE Computer Society (1979)
2. Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520-536. Springer, Heidelberg (2012)
3. Coppersmith, D.: Private communication to Scott Vanstone (1979)
4. Coppersmith, D.: Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology 10(4), 233-260 (1997)
5. 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)
6. Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235-256. Springer, Heidelberg (2010)
7. May, A., Meurer, A., Thomae, E.: Decoding random linear codes in 20.054n. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107-124. Springer, Heidelberg (2011)
8. Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Trans. Inf. Theory 24, 106-110 (1978)
9. Pollard, J.M.: Monte carlo methods for index computation (mod p). Math. Comput. 32(143), 918-924 (1978)
10. Shanks, D.: Class number, a theory of factorization and genera. In: Proceedings of Symposia in Pure Mathematics, vol. 20, AMS, pp. 415-440 (1971)
11. 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)
12. Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory and Applications. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)
13. Stinson, D.R.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput. 71(237), 379-391 (2002)
14. van Oorschot, P.C., Wiener, M.: On Diffie-Hellman key agreement with short exponents. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 332-343. Springer, Heidelberg (1996)