1)
Message boards :
Sophie Germain Prime Search :
Sophie Germain Prime Search
(Message 18116)
Posted 4883 days ago by Bruno
@Alan: Actually the factor k is also a multiplicative time factor to compute the result with the LLR algorithm. The complexity is about k * complexity of prime-testing of (2^n-1).
