Slope packings and coverings, and generic algorithms for the discrete logarithm problem

Journal of Combinatorial Designs

Volumn 11, Issue 1, 2003, Pages 36-50

  Chateauneuf, M ^a   Ling, A C H ^b   Stinson, D R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Vermont ^*  (United States)

Author keywords

Discrete logarithm problem; Generic algorithm; Sidon set

Indexed keywords

EID: 4544261296     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.10033     Document Type: Article

References (10)

1. A. Blokhuis, H. A. Wilbrink, and A. Sali, Perfect sumsets in finite abelian groups, Linear Algebra and its Applications 226-228 (1995), 47-56.
2. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, A new table of constant weight codes, IEEE Trans Inform Theory 36 (1990), 1334-1380.
3. H. Haanpää, A. Huima, and P.R.J. Östergard, Sets in Zn with distinct sums of pairs, Discrete Appl Math (to appear).
4. D. L. Kreher and D. R. Stinson, Combinatorial algorithms: Generation, enumeration and search, CRC Press, 1999.
5. V. I. Nechaev, On the complexity of a deterministic algorithm for a discrete logarithm, Math Notes 55 (1994), 165-172.
6. A. Odlyzko, Discrete logarithms: The past and the future, Designs, Codes and Cryptography 19 (2000), 129-145.
7. R. M. Roth and G. Seroussi, Location-correcting codes, IEEE Trans Inform Theory 42 (1996), 554-565. (Pubitemid 126770508)
8. C. P. Schnorr, Small generic hardcore subsets for the discrete logarithm problem: Short secret DL-keys, Inform Process Letters 79 (2001), 93-98. (Pubitemid 32446527)
9. V. Shoup, Lower bounds for discrete logarithms and related problems, Lecture Notes Comp Sci 1223 (1997), 256-266 (EUROCRYPT '97 Proceedings). (Pubitemid 127067806)
10. E. Teske, Square-root algorithms for the discrete logarithm problem (a survey). Public key cryptography and computational number theory, Walter de Gruyter, 2001, pp. 283-301. Canada of Canada