Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2008-02-19, 03:08   #1
Oct 2007

3 Posts
Default On discrete logs

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
kpatsak is offline   Reply With Quote
Old 2008-02-19, 04:44   #2
maxal's Avatar
Feb 2005

22·32·7 Posts

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
maxal is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
NFS@Home msieve logs for pastebin url pinhodecarlos NFS@Home 399 2021-12-01 22:15
Der Geoibils now require logs+nuts(to be pronounced with New Joisey accent) c10ck3r Lounge 8 2013-11-18 22:57
Didn't get the credits and no server logs joblack PrimeNet 5 2010-07-02 22:31
llrnet Server Date/Time stamps in logs IronBits No Prime Left Behind 30 2008-11-20 14:59
Converting Logs Numbers Math 5 2005-08-14 06:29

All times are UTC. The time now is 13:04.

Fri Dec 3 13:04:57 UTC 2021 up 133 days, 7:33, 0 users, load averages: 1.17, 1.25, 1.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.