On the low hamming weight discrete logarithm problem for nonadjacent representations

Applicable Algebra in Engineering, Communications and Computing

Volumn 16, Issue 6, 2006, Pages 461-472

  Muir, J A ^a   Stinson, D R ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Discrete logarithm; Elliptic curve; Gray code; Nonadjacent form

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING; SECURITY OF DATA;

DISCRETE LOGARITHM; ELLIPTIC CURVE; GRAY CODE; NONADJACENT FORM;

CRYPTOGRAPHY;

EID: 31444456161     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-005-0187-7     Document Type: Article

References (14)

1. Chase, P.J.: Combination generation and graylex ordering. Congressus Numerantium 69, 215-242 (1989)
2. Deng, D., Stinson, D.R., Li, P.C., van Rees, G.H.J., Wei, R.: Constructions and bounds for splitting systems. Submitted
3. Eades, P., McKay, B.: An algorithm for generating subsets of fixed size with a strong minimal change property. Information Processing Letters 19, 131-133 (1984)
4. Heiman, R.: A note on discrete logarithms with special structure. Lecture Notes in Computer Science 658, 454-457 (1993) (Advances in Cryptology - EUROCRYPT '92)
5. Jenkyns, T.A., McCarthy, D.: Generating all k-subsets of {1, . . ., n} with minimal changes. Ars Combinatoria 40, 153-159 (1995)
6. Knuth, D.E.: The Art of Computer Programming, Pre-fascicle 3 A. A Draft of Section 7.2.1.3: Generating all Combinations. Version of Sepetmber 2, 2004
7. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration and Search, CRC Press 1999
8. Ling, A.C.H., Li, P.C., van Rees, G.H.J.: Splitting systems and separating systems. Discrete Mathematics 279, 355-368 (2004)
9. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, CRC Press 1996
10. Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Informatique Théorique et Applications 24, 531-543 (1990)
11. Muir, J.A., Stinson, D.R.: Minimality and other properties of the width-w nonadjacent form. To appear in Mathematics of Computation
12. Savage, C.: A survey of combinatorial Gray codes. SIAM Review 39, 605-629 (1997)
13. Stinson, D.R.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Mathematics of Computation 71, 379-391 (2002)
14. Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: Public-Key Cryptography and Computational Number Theory, pp. 283-301. Walter de Gruyter, 2001