1 | initial version |

No surprise here since it's a hard computational problem. I suggest to start with factoring the modulus (which can also be computationally hard), which will allow allow to split computing the discrete logarithm into smaller subproblems and to compute the order of the base.

2 | No.2 Revision |

No surprise here since it's a hard computational problem. I suggest to start with factoring the modulus (which can also be computationally hard), which will allow ~~allow ~~to split computing the original discrete logarithm into those modulo smaller ~~subproblems ~~numbers (factors of the modulus) and ~~to compute the ~~with a known order of the base.

3 | No.3 Revision |

No surprise here since it's a hard computational problem. I suggest to start with factoring the modulus (which can also be computationally hard), which will allow to split computing the original discrete logarithm into those modulo smaller ~~numbers ~~prime powers (factors of the ~~modulus) and with a known order of the base.~~modulus), which is typically simpler.

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.