On Fri, Jul 31, 2015 at 06:46:22PM +, Viktor Dukhovni wrote:
On Fri, Jul 31, 2015 at 11:19:39AM -0700, Bill Cox wrote:
Cool observation. From running a bit of Python code, it looks like
the probability that GCD(p-1, p-q) == 4 is a bit higher than 15%, at
least for random numbers
I am trying to compile openssl 1.0.2 SNAP 20150801
and now I get
if [ -n libcrypto.so.1.0.0 libssl.so.1.0.0 ]; then (cd ..; make
libcrypto.so.1.0.0); fi
[ -z ] || gcc -fPIC -DOPENSSL_PIC -DZLIB_SHARED -DZLIB -DOPENSSL_THREADS
-pthread -D_THREAD_SAFE -D_REENTRANT -DDSO_DLFCN -DHAVE_DLFCN_H
A few weeks ago, I overloaded my server and compiler and
now I get
signed content test streaming BER format, 2 DSA and 2 RSA keys, no attributes:
OK
signed content test streaming S/MIME format, 2 DSA and 2 RSA keys: verify error
*** Error code 1
Stop.
*** Error code 1
Stop.
How can debug and
On Sat, Aug 01, 2015 at 01:50:00PM +, Ben Laurie wrote:
On Sat, 1 Aug 2015 at 14:22 mancha manc...@zoho.com wrote:
On Fri, Jul 31, 2015 at 06:46:22PM +, Viktor Dukhovni wrote:
On Fri, Jul 31, 2015 at 11:19:39AM -0700, Bill Cox wrote:
Cool observation. From running a bit of
On Sat, 1 Aug 2015 at 14:22 mancha manc...@zoho.com wrote:
On Fri, Jul 31, 2015 at 06:46:22PM +, Viktor Dukhovni wrote:
On Fri, Jul 31, 2015 at 11:19:39AM -0700, Bill Cox wrote:
Cool observation. From running a bit of Python code, it looks like
the probability that GCD(p-1, p-q)
On Fri, Jul 31, 2015 at 11:31:08PM +, p...@securecottage.com wrote:
Hi Mancha,
Since p*q-1==(p-1)*(q-1)+(p-1)+q-1) any prime that divides (p-1) and
(q-1) will divide all 4 of the terms in the definition of p*q-1. Thus
it will be a common factor in the totient.
Hi Paul, many thanks for
On Sun, Aug 02, 2015 at 12:59:49AM +, p...@securecottage.com wrote:
He managed to get a common factor of
gcd(p-1,q-1) = 2 * 28559 from the following 1024 bit rsa generated key
(factorisation of p*q-1 is shown):
n-1 = 2 * 3^3 * 7 * 13 * 67 * 2399 * 28559 *
I'd like to thank several people for looking into my assertion that it
is possible for common factors in p-1 and q-1 to leak from the
factorisation of n-1.
Particularly, Viktor Dukhovni, for trying tens of thousands of key
generation iterations to see if common factors are possible.
