5/29    I'm looking for a list of 512bit or larger primes I can use
        for a diffie-hellman implementation I'm working on. Google
        didn't produce many workable matches. Anyone know where I
        might be able to find a list?
        \_ How many do you need?
           \_ A dozen or so should be more than enough. My understanding
              of dh (which is quite weak) is that you don't need the
              primes to be different for each client and server thus
              I believe I can make do with very few primes.
              \_ A dozen!?  You are incapable of entering 'prime list' or
                 'large primes' into google?  Are you a moron?  Do you speak
                 English?  Do you understand how to query a search engine?
                 'Google didn't produce many workable matches' indeed.
                 The world is full of lazy idiots, and you, sir, are one of
                 them.
                 \_ Any large prime won't do, it has to be a sg prime.
                    I've managed to find a few 3 or 4 that are 512bit or
                    smaller. Most of the other matches are 1024bit or
                    greater and I can't use those.
                    \_ http://www.privacy.nb.ca/cryptography/archives/coderpunks/new/1998-04/0079.html
                    \_ You want to use template meta-programming to generate
                       a sufficient number of primes at compile time, and store
                       it in a table for run-time use.
                 \_ One would think google is easier (and more user friendly)
                    than the motd and people might figure this out but....