laserlight;11036555 wrote:The rsa option refers to the RSA public key crypto algorithm, not to the company founded by the same people who that algorithm is named after.
I appreciate you pointing this out, but I think the question is still legitimate. It would not be unheard of for an open source project to mimic the techniques used by the company founded by the guys who invented the algorithm.
As Bruce Schneier has been quoted as saying, "Security is not something you can buy, it is something you must get for yourself," or something like that. Note that I have not received any message signed by Schneier that will allow me to reliably attribute this saying to him.
This topic seems to relate to my other one on Counting Primes. If there are roughly 101223 primes of big length 4096, how does ssh-keygen generate a key so quickly? Isn't verifying a prime with 1200 decimal digits going to take a LONG time? NOTE: I'm still getting comfortable with the math, apparently the product of the prime keys has 4096 bit length. Still, even half that is a huge number and I find it hard to believe that any program could reliably accomplish this feat as quickly as ssh-keygen seems to.
Dalescop: perhaps you set up puTTY (or ssh) with a key pair? I know it's probably bad practice but I like to generate my key pairs without a passphrase -- saves a lot of typing over the course of a day.