Re: A very fast Fermat factoring algorithm
From: Erwann ABALEA (erwann_at_abalea.com)
Date: 03/31/05
- Next message: Gib Bogle: "Re: Critiquing surrogate factoring"
- Previous message: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- In reply to: none: "Re: A very fast Fermat factoring algorithm"
- Next in thread: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 31 Mar 2005 08:22:19 +0200
On Thu, 31 Mar 2005, it was written:
> I use 4k bit keys. I let 1k bit keys expire rather quickly..
>
> Computers are fast and cheap enough nowdays. There really is no reason
> not to use them.
>
> I would like to think that CA root keys are in the 8K+ bits range.......
4k bits at most, but generally 2k bits max:
- speed problem
- hardware support (you use a software key, they use hardware tokens
evaluated, tamper evident/resistant, ...)
- unability to forsee more than 20 years in advance, so anything bigger
than 2k bits doesn't have a lot of sense.
-- Erwann ABALEA <erwann@abalea.com> - RSA PGP Key ID: 0x2D0EABD5 ----- ah koi ca sert de donner son nom si ce n'est pour avoir des emmerdes ? vous avez pas vu encore ke des barges il y en a partout et que devoiler toute ces informations c'est dangereux ? -+- Mickey in GNU : Le retour du fils de l'homme invisible -+-
- Next message: Gib Bogle: "Re: Critiquing surrogate factoring"
- Previous message: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- In reply to: none: "Re: A very fast Fermat factoring algorithm"
- Next in thread: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|