Comments on: Random prime numbers using OpenSSL bignum http://ardoino.com/7-maths-openssl-primes-random/ Homo quisque faber ipse fortunae suae Fri, 21 Nov 2008 05:51:14 +0000 http://wordpress.org/?v=2.6 By: Paolo Ardoino http://ardoino.com/7-maths-openssl-primes-random/#comment-4115 Paolo Ardoino Thu, 17 Jul 2008 22:41:06 +0000 http://ardoino.com/index.php/1970/01/01/generate-random-prime-numbers-using-openssl-bignum/#comment-4115 Yes, it think this should be the problem. It works for higher number of bits, isn't it? :) Yes, it think this should be the problem. It works for higher number of bits, isn’t it? :)

]]> By: Ted http://ardoino.com/7-maths-openssl-primes-random/#comment-4081 Ted Thu, 17 Jul 2008 05:43:18 +0000 http://ardoino.com/index.php/1970/01/01/generate-random-prime-numbers-using-openssl-bignum/#comment-4081 Well, I found this: http://www.openssl.org/docs/apps/genrsa.html "...BUGS A quirk of the prime generation algorithm is that it cannot generate small primes. Therefore the number of bits should not be less that 64. For typical private keys this will not matter because for security reasons they will be much larger (typically 1024 bits). ..." I wonder if this is the issue? Well, I found this:

http://www.openssl.org/docs/apps/genrsa.html

“…BUGS
A quirk of the prime generation algorithm is that it cannot generate small primes. Therefore the number of bits should not be less that 64. For typical private keys this will not matter because for security reasons they will be much larger (typically 1024 bits). …”

I wonder if this is the issue?

]]> By: Ted http://ardoino.com/7-maths-openssl-primes-random/#comment-4078 Ted Thu, 17 Jul 2008 04:58:33 +0000 http://ardoino.com/index.php/1970/01/01/generate-random-prime-numbers-using-openssl-bignum/#comment-4078 Hmm, OK, compiling with OpenSSL ver 0.9.8h on a Sparc 5 running Solaris 2.5.1 yields the following: # ./genprimes 56 Prime generator by (c) 2004 Paolo Ardoino usage: ./genprimes [num_bits] Generating 56 bits primes. Wait... 69834779657420543 61474498444152383 66239213586814127 61351200631567103 71739027417375587 59701796016635783 65300592723857159 59533171614579239 55576223021154503 ^C# so far looks impressive... # ./genprimes 8 Prime generator by (c) 2004 Paolo Ardoino usage: ./genprimes [num_bits] Generating 8 bits primes. Wait... 35879 35879 35879 35879 35879 ^X35879 ^C# # ./genprimes 4 Prime generator by (c) 2004 Paolo Ardoino usage: ./genprimes [num_bits] Generating 4 bits primes. Wait... 35879 35879 ^C# ./genprimes 1 Prime generator by (c) 2004 Paolo Ardoino usage: ./genprimes [num_bits] Generating 1 bits primes. Wait... 35879 35879 ^C# l Hmmmmm...... Hmm, OK, compiling with OpenSSL ver 0.9.8h on a Sparc 5 running Solaris 2.5.1 yields the following:

# ./genprimes 56
Prime generator by (c) 2004 Paolo Ardoino
usage: ./genprimes [num_bits]
Generating 56 bits primes.
Wait…
69834779657420543
61474498444152383
66239213586814127
61351200631567103
71739027417375587
59701796016635783
65300592723857159
59533171614579239
55576223021154503
^C#

so far looks impressive…

# ./genprimes 8
Prime generator by (c) 2004 Paolo Ardoino
usage: ./genprimes [num_bits]
Generating 8 bits primes.
Wait…
35879
35879
35879
35879
35879
^X35879
^C#
# ./genprimes 4
Prime generator by (c) 2004 Paolo Ardoino
usage: ./genprimes [num_bits]
Generating 4 bits primes.
Wait…
35879
35879
^C# ./genprimes 1
Prime generator by (c) 2004 Paolo Ardoino
usage: ./genprimes [num_bits]
Generating 1 bits primes.
Wait…
35879
35879
^C# l

Hmmmmm……

]]> By: Nobody http://ardoino.com/7-maths-openssl-primes-random/#comment-3669 Nobody Mon, 07 Jul 2008 09:32:17 +0000 http://ardoino.com/index.php/1970/01/01/generate-random-prime-numbers-using-openssl-bignum/#comment-3669 "Don't ask me no questions and I wont tell you no lies" #include General purpose input/output routines #include Some UNIX standard None of the above are required, but use to be a good idea to include them, since these are probably the most common headers. #include Another standard UNIX header, which declares free, malloc etc... (more info at http://en.wikipedia.org/wiki/Stdlib.h) #include This one is very useful, contains functions, macros and routines to work with (char *) as strings (includes strlen, strtol, memset and much more things) #include Openssl BIGNUM declarations, for arithmetics with huge numbers (such as the primes needed to implement RSA algorithm) “Don’t ask me no questions and I wont tell you no lies”

#include
General purpose input/output routines

#include
Some UNIX standard

None of the above are required, but use to be a good idea to include them, since these are probably the most common headers.

#include
Another standard UNIX header, which declares free, malloc etc…
(more info at http://en.wikipedia.org/wiki/Stdlib.h)

#include
This one is very useful, contains functions, macros and routines to work with (char *) as strings (includes strlen, strtol, memset and much more things)

#include
Openssl BIGNUM declarations, for arithmetics with huge numbers (such as the primes needed to implement RSA algorithm)

]]> By: fredi http://ardoino.com/7-maths-openssl-primes-random/#comment-3665 fredi Mon, 07 Jul 2008 08:25:13 +0000 http://ardoino.com/index.php/1970/01/01/generate-random-prime-numbers-using-openssl-bignum/#comment-3665 Please explain what is the purpose of the "#include " in your header file? <a href="http://www.sportsbookteaser.com" rel="nofollow">fredi</a> Please explain what is the purpose of the “#include ”

in your header file?

fredi

]]>