On 2/28/11 11:01 AM, florent ainardi wrote: > as regards symetric cipher algorithm, does algorithm included in the > library manage key with a size greater than 128 bits
Yes. > in asymetric mode for the RSA, does the size of the module are > greater or equal to 2048 bits Yes (up to 4096). > do you have more detail on how are built prime number? if p and q > are two primes numbers, is there any test during the generation > of these numbers ? some tests like : does p = q ? does the > internal state for re-treatment of random number is greater than > 128 bits? Read the source for these details. > do you apply the standard and recommandation for the generation > of prime number? There is no universal standard, but GnuPG does follow the best practices for random number generation. > for random number, do you know if the re-treatment algorythm has a > non volatil memory as specify in the standard for the generation > of big random number? do you know if at this time, the libray has > vulnerability referenced in the CVE ? and if yes is there any patch > available ? I don't understand these questions. > do you confirm that the library is supported for 32/64 bit windows > systems and 32/64 bit linux system Which library -- gpgme, libgcrypt, which? As far as Linux goes, I've seen it work on both 32- and 64-bit architectures. As far as Windows goes, I've only ever seen them come in 32-bit versions. In the future, *please* consolidate your questions into one email message. _______________________________________________ Gnupg-users mailing list [email protected] http://lists.gnupg.org/mailman/listinfo/gnupg-users
