TITLE: Is there a list of safe prime numbers?
QUESTION [9 upvotes]: I am looking for a list of precomputed safe prime numbers. Where can I get such a list?

REPLY [4 votes]: With a little haskell, you can generate what you want.
ld n = ldf 2 n

ldf k n | rem n k == 0 = k
        | k^2 > n      = n
        | otherwise    = ldf (k+1) n

isprime n = isprime' (abs n)

isprime' n
  | n < 2 = False
  | otherwise = ld n == n

issophie n | not (isprime n)     = False
           | isprime (2 * n + 1) = True
           | otherwise           = False

sophies = filter issophie [2..]

safeprimes = map (\x -> 2 * x + 1) sophies

Then something like
first100safes = take 100 safeprimes

the5thsafe = safeprimes!!5

Many safeprimes will take a bit (take 10000 safeprimes).  You might want to capture them and keep them somewhere.  With a little modification, you can start with a big sophie and work up.  Maybe generate the next 10000 and add them to your list. Start things up and go get lunch.