- **Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=8*)

- - **On discrete logs**
(*https://www.mersenneforum.org/showthread.php?t=10005*)

On discrete logsHi,
I'd like to know if there's a class of prime numbers where the discrete log can be computed more efficiently, or if there's an algorithm(besides brute force) that can speed up the computation of discrete log when knowing an upper bound |

time to compute discrete logs modulo prime p is very sensitive to prime factorization of p-1. in particular, it becomes easy if all prime factors of p-1 are small, and hard if p-1 has a large prime factor.
as of algorithms - take a look at [url]http://www.cs.toronto.edu/~cvs/dlog/[/url] |

All times are UTC. The time now is 03:59. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.