> This is hardly anything remotely resembling a formal proof, of course. But
> it should give you the basic idea -- it's a difficult problem because the
> numbers are big.
Your argument only applies to "your algorithm". The question is whether there
exists something
else besides a trial / brute fo
So if you are so brave try the example given before.
Than you will feel reality.
-
Best Regards Rustam !!!
2009/6/6 David Schwartz :
>
>> hello,
>> when i read some books about cryptography, it always go that the
>> cryptography is based on the difficult math problem, for example big
>> integer decomposition,
>> i don't understand it, for if we know that n = p*q , p, q are prime ,
>> why it's diff
> hello,
> when i read some books about cryptography, it always go that the
> cryptography is based on the difficult math problem, for example big
> integer decomposition,
> i don't understand it, for if we know that n = p*q , p, q are prime ,
> why it's difficult to get p and q ? i think ,i
On Fri, Jun 05, 2009, Chris Bare wrote:
> I'm trying to understand the ASN1 macros like:
> ASN1_SEQUENCE
> IMPLEMENT_ASN1_FUNCTIONS
> etc to implement my own structures.
>
> What examples in the code would be best to follow, especially for nested
> structures with optional elements?
Well some of
> From: owner-openssl-us...@openssl.org On Behalf Of Don M
> Sent: Friday, 05 June, 2009 02:37
> I try to write a program to verify a signature, all results of
> openssl(0.9.8.h) function calls are fine except the last one
> result = EVP_VerifyFinal(md_ctx, sig, sig
On Fri, Jun 05, 2009, ronald braswell wrote:
> I am getting a core dump from d2i in the following code. The offending
> line is:
>
> *val = meth->i2v( meth, meth->d2i( NULL, &data, ext->value->length ), NULL
> );*
>
> I am running the 0.9.8k version of openssl compiled for shared objects,
> 32b
I am getting a core dump from d2i in the following code. The offending
line is:
*val = meth->i2v( meth, meth->d2i( NULL, &data, ext->value->length ), NULL
);*
I am running the 0.9.8k version of openssl compiled for shared objects,
32bit.
Can anyone spot what I am doing wrong? Has anyone else
Flaky intermediate CA not being served up on the failed handshakes.
From: Steve Gallivan
Sent: Monday, June 01, 2009 5:51 PM
To: openssl-users@openssl.org
Subject: SSL Handshake question
Hello,
I apologize if this is an obvious NOOB question - my Google-Fu is not up to
snuff on this one:
We're
Hi
I have a simple Question (I hope): How can I do salting data with the
API like in command line -salt switch?
Any hint?
Regards
Robert
__
OpenSSL Project http://www.openssl.org
User Support Mail
Dear All
I found the problem is my java side using missing code, sorry:-U.
--
View this message in context:
http://www.nabble.com/openssl-cannot-decrypt-the-%22RSA-ECB-PKCS1Padding%22-from-java-tp23881221p23885198.html
Sent from the OpenSSL - User mailing list archive at Nabble.com.
_
I'm trying to understand the ASN1 macros like:
ASN1_SEQUENCE
IMPLEMENT_ASN1_FUNCTIONS
etc to implement my own structures.
What examples in the code would be best to follow, especially for nested
structures with optional elements?
--
Chris Bare
ch...@bareflix.com
__
Proxy certificates aren't appropriate for this application. I was
simply giving an example of why certificate expirations in hours are
reasonable things to support.
-Kyle H
On Thu, Jun 4, 2009 at 4:13 PM, Lucas Mocellin wrote:
>
>
> On Thu, Jun 4, 2009 at 2:31 PM, Ger Hobbelt wrote:
>>
>> On Th
In all fairness - no one has proven that the problem is indeed difficult or not
(as in
can be solved in polynomial time or not). I am not disputing the fact that the
problem is difficult - but just because no one knows an easy (polynomial)
answer does not mean that such solution does not exist.
S
On Fri, Jun 05, 2009 at 03:52:07PM +0800, jaze lee wrote:
> hello,
> when i read some books about cryptography, it always go that the
> cryptography is based on the difficult math problem, for example big
> integer decomposition,
> i don't understand it, for if we know that n = p*q , p, q ar
Hello Patrick
I am using Luna PCI as my HSM.
To answer your questions,
>>First question: Do you have OpenSSL patched to use that particular HSM as an
engine?
Yes, I verified with the documentation from the vendor.
>>Second question: Do you have a openssl.cnf set up that properly instantiates
th
hello,
when i read some books about cryptography, it always go that the
cryptography is based on the difficult math problem, for example big
integer decomposition,
i don't understand it, for if we know that n = p*q , p, q are prime ,
why it's difficult to get p and q ? i think ,if we know the
17 matches
Mail list logo
