> From: owner-openssl-us...@openssl.org On Behalf Of David Schwartz
> Sent: Wednesday, 13 April, 2011 18:55
> On 4/13/2011 2:35 AM, pattabi raman wrote:
>
> > *1. If I can't use sprintf then how can I copy the enrypted
> message to a
> > character buffer. Bcoz so far I am sending the request to
On 4/13/2011 2:35 AM, pattabi raman wrote:
*1. If I can't use sprintf then how can I copy the enrypted message to a
character buffer. Bcoz so far I am sending the request to middleware in
Char Buffer using TCP /IP socket. How can I able to achieve now.*
**
If you don't know how to copy bytes o
Hi Dave,
Thanks for your reply.
*1. If I can't use sprintf then how can I copy the enrypted message to a
character buffer. Bcoz so far I am sending the request to middleware in Char
Buffer using TCP /IP socket. How can I able to achieve now.*
**
*2. Actually I am using 2048 bit public key. So wha
On 4/11/2011 6:36 PM, Adrian D. Sacrez wrote:
> I'm fairly new to OpenSSL. How do I convert the rsa generated
> ry rsa_keygen_ex() into a public and private key?
> Is there a way to do that?
I assume you mean RSA_generate_key_ex. It already is. The purpose of
this function is to generate a new
esday, April 12, 2011 7:19 AM
To: openssl-users@openssl.org
Subject: RE: RSA key
On Mon, 2011-04-11 at 17:53 -0400, Dave Thompson wrote:
> > From: owner-openssl-us...@openssl.org On Behalf Of pattabi raman
> > Sent: Sunday, 10 April, 2011 08:14
>
> > I am using the
On Mon, 2011-04-11 at 17:53 -0400, Dave Thompson wrote:
> > From: owner-openssl-us...@openssl.org On Behalf Of pattabi raman
> > Sent: Sunday, 10 April, 2011 08:14
>
> > I am using the below code snippet and am able to do the encytption.
>
> > But I need to convert the enc
> From: owner-openssl-us...@openssl.org On Behalf Of pattabi raman
> Sent: Sunday, 10 April, 2011 08:14
> I am using the below code snippet and am able to do the encytption.
> But I need to convert the encrypted format to Binary format inorder
> to pass the encr
Thanks for the reply. How do I transfer or copy the keyfile generated by
RSA_keygen_ex()?
From: owner-openssl-us...@openssl.org [mailto:owner-openssl-us...@openssl.org]
On Behalf Of pattabi raman
Sent: Sunday, April 10, 2011 8:14 PM
To: openssl-users@openssl.org
Subject: Re: RSA key
Hi,
I am
Hi,
> I am using the below code to do the encytption of the publickey and it
> works fine.
>
> But I need to convert the encrypted format to Binary format inorder to pass
> the encrypted key to a different system.
>
pls suggest how to do the same ??? How can I convert the encrypted message
to
Hi,
I am using the below code snippet and am able to do the encytption.
But I need to convert the encrypted format to Binary format inorder to pass
the encrypted key to a different system. Any one pls suggest how to do the
same ???
*Code snippet :*
**
*void** EncrCardPin(char *pin,char** *encpi
> From: owner-openssl-us...@openssl.org On Behalf Of Panikulam Vivek
> Sent: Thursday, 23 September, 2010 10:53
> I have generated a private key using the below command and
> want to extract the public key in a format that is compatible
> with sites using Java.
>
> From: owner-openssl-us...@openssl.org On Behalf Of krishnamurthy
santhanam
> Sent: Monday, 06 September, 2010 12:40
> I need to write [RSA] public and private key into text file
> ...is it possible using BN?
Yes, but for supported formats you don't need to;
see reply
On 9/27/07, Marek Marcola <[EMAIL PROTECTED]> wrote:
> Hello,
> > Hi, I'm developing a client-server architecture to encrypt/decrypt
> > data which works like this: the client asks the server for the key
> > using a ssl connection, the server transmits the key to the client that
> > then encrypts/
Hello,
> Hi, I'm developing a client-server architecture to encrypt/decrypt
> data which works like this: the client asks the server for the key
> using a ssl connection, the server transmits the key to the client that
> then encrypts/decrypts the data.
>
> I'd like to know if there is a way to c
> I am not familar with ASN.1, or any of the specifice of which the rsa
> key is generated. It just seemed as it should not be so.
> What is the ASN.1 encoding, and how is it used?
The vast majority of file formats begin with a header that is similar or
identical for files that contain different
Hello,
> I am not familar with ASN.1, or any of the specifice of which the rsa
> key is generated. It just seemed as it should not be so.
> What is the ASN.1 encoding, and how is it used?
RSA private key is a set of big numbers: n,d,e,p,q,dmp1,dmq1,iqmp.
(this is not one number).
When this numbers
I am not familar with ASN.1, or any of the specifice of which the rsa
key is generated. It just seemed as it should not be so.
What is the ASN.1 encoding, and how is it used?
On 8/9/07, Marek Marcola <[EMAIL PROTECTED]> wrote:
> Hello,
> > Looks like this may be the issue, a flaw in the key gener
Hello,
> Looks like this may be the issue, a flaw in the key generation algorithm.
> https://www.kb.cert.org/vuls/id/724968
Probably not, this is flow in Montgomery multiplication which is used
in modular exponentation. Of course modular exponentation is used
in key generation process in p,q prime
Looks like this may be the issue, a flaw in the key generation algorithm.
https://www.kb.cert.org/vuls/id/724968
__
OpenSSL Project http://www.openssl.org
User Support Mailing List
These are the first few bytes of the key. Here they are from 10 keys
generated with the command: openssl genrsa -rand /dev/urandom
MIIBOwIBAAJ
MIIBOgIBAAJ
MIIBPAIBAAJ
MIIBPQIBAAJ
MIIBOgIBAAJ
MIIBOgIBAAJ
MIIBOQIBAAJ
MIIBOwIBAAJ
MIIBOwIBAAJ
MIIBOwIBAAJ
On 8/9/07, jimmy bahuleyan <[EMAIL PROTECTED]>
Hello,
> I have noticed when generating rsa keys that the first 10 digits or
> so are identical or nearly identical. Is this normal or is something
> wrong? Does this issue occur for anyone else?
> The version of openssl I am using is openssl-0.9.8b-8.3.fc6 and I am
> using -rand /dev/urandom to
Patrick Parsons wrote:
> Hello,
> I have noticed when generating rsa keys that the first 10 digits or so are
> identical or nearly identical. Is this normal or is something wrong? Does
> this issue occur for anyone else?
could you post the bytes that you're referring to. (my guess is that
it's t
This helps a lot. Thanks for the clarification.
-Geoff
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Steve Marquess
Sent: Thursday, April 19, 2007 4:48 PM
To: openssl-users@openssl.org
Subject: Re: RSA Key exchange and FIPS compliance
Gatfield
Gatfield, Geoffrey wrote:
Hello,
We use OpenSSL for encryption within our application. I am now
enhancing our application to become FIPS compliant. The OpenSSL FIPS
Security Policy lists RSA key wrapping and key establishment as
non-approved. But the policy states that it is included when 80
> We use OpenSSL for encryption within our application.
> I am now enhancing our application to become FIPS compliant.
> The OpenSSL FIPS Security Policy lists RSA key wrapping and
> key establishment as non-approved. But the policy states that
> it is included when 80 to 150 bits of encryption st
Hello,
> I have a general question about RSA Key Block.
Maybe key_material is more precise.
> The output of PRF with the master_secret to give us many keys. It
> includes: client_write_MAC_secret, server_wriet_MAC_secret,
> client_write_key, server_write_key, client_write_IV, server_write_IV.
>
Please note that the importance of RSA is going to decline in favor of
Elliptic Curve Crypto over GF(p). In particular, by 2010 ECC will be
mandated. I suspect there are cryptographic reasons for it.
__
OpenSSL Project
On Wed, Aug 17, 2005, Tan Eng Ten wrote:
> Hi all,
>
> This is a general crypto question and I hope someone could help me
> out.
>
> Often we use RSA of 512, 1024, 2048, 4096, etc. bit lengths. Are
> other sizes such as 520/1045 bit "valid"? Mathematically, it should
>
Microsoft Root
Certificate Authority key in the Microsoft Certificate Store is 4096 bits in
length.
Steven
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Victor Duchovni
Sent: Wednesday, 17 August 2005 4:45 PM
To: openssl-users@openssl.org
Subject: Re: RS
On Wed, Aug 17, 2005 at 02:21:30PM +0800, Tan Eng Ten wrote:
> This is a general crypto question and I hope someone could help me
> out.
>
> Often we use RSA of 512, 1024, 2048, 4096, etc. bit lengths. Are
> other sizes such as 520/1045 bit "valid"? Mathematically, it sh
Hi
I am unable to provide u with exact answer.
but i thought it relevent to reply u.
because I have also worked on RSA api's
Following are the command to generate rsa keys
1) openssl genrsa -out private.pem 1024 <- This generates a 1024 bit
keypair, but both keys are held in a single file ini
Erik Norgaard wrote:
pair (n,e) and the private key can be respresented either as a pair
(n,d) or in its Chinese Remainder Theorem form (CRT). The latter should
be faster, but only applies for keys with more than two primefactors.
Oh, I see, you use CRT to designate the key with the added speedup
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (as
Erik Norgaard wrote:
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operatio
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (as
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (assuming a 1000 bit key). E
Charles B Cranston wrote:
You should factor in the RSA speedups in your space estimates.
Typically a public exponent of 2^16+1 is used so you need not
pass this separately for a public key. However, the speedup
for the private key operation involves all those other fields
in a private key, which e
Here's a crazy idea:
The computer talking to the Java card rolls a random session key.
In the first operation transfer a private key into the device,
encrypted by the session key.
In the second operation transfer the data to be encrypted and
the session key. The Java card can decrypt the private k
You should factor in the RSA speedups in your space estimates.
Typically a public exponent of 2^16+1 is used so you need not
pass this separately for a public key. However, the speedup
for the private key operation involves all those other fields
in a private key, which expands the space requireme
Pawel Jakub Dawidek wrote:
Hello.
We're trying to get as small RSA private key as possible, because we
are short in space (we want to store it on a smart card, so every byte
is important).
We found a way to cut it a bit by NULLing some pointers inside RSA
structure:
RSA *key;
key->p
Sorry for the stupid question, I have figured it out.
Thanks
JoeJoe smith <[EMAIL PROTECTED]> wrote:
Hi,
I have the following code
#include
#include
int main()
{
OpenSSL_add_all_algorithms();
ERR_load_crypto_strings();
ERR_print_errors_fp(stderr);
RSA *rsa;
BIO *publickey;
ERR_load_crypto
> Hi Andrew,
> > How unique is it? Is it statistically improbable that I could
> > generate the
> > same key twice?
> If you have properly seeded your random generator, generated
> (RSA) keys should
> be quite unique.
It doesn't matter. Breaking an RSA key basically involves factoring a
Hi Andrew
It was a good job I asked the question I think. Gerrit and yourself have
caused me to sit down and learn a lot more about cryptography than I had
intended, but it has been very useful.
On Friday 19 Mar 2004 01:01, Andrew Mann wrote:
> I don't see that you should be using public
I don't see that you should be using public key encryption here. Why
don't you just make a secret key, encrypt your data, send the data and a
reference along with it, and output the secret key and the reference?
Public key operations are slow. If you intend to encrypt an entire
file with th
On Thursday 18 Mar 2004 16:14, Gerrit E.G. 'Insh_Allah' Hobbelt wrote:
> Hi Andrew,
>
> > How unique is it? Is it statistically improbable that I could generate
> > the same key twice?
>
> If you have properly seeded your random generator, generated (RSA) keys
> should be quite unique.
>
Here is a
On Sun, Feb 29, 2004, Claus Nagel wrote:
> hello, I hope someone can help me with the following problem:
> I'm trying to generate a rsa key pair in perl using the Crypt::RSA module.
> this works fine so far. I am converting the resulting private key into PEM
> format and it is checked ok by 'opens
On Sun, Dec 14, 2003, [EMAIL PROTECTED] wrote:
> Hi..
>
> I am using crypto library of openssl. I need to generate a RSA key using
> RSA_generate_key() and then store the key into a file and later read it from a
> file when I need it.
> As far as my knowledge of openssl goes... I generate the ke
Rich Salz wrote:
why I can't build certificate with one 64 or 128 bits size RSA key?
Because it could be cracked almost immediately. :)
Yes, but what's your point? ;-)
Response to OP, Rich Salz knows at least as much as I do about
this stuff --
Seriously, no smiley here -- independent of recomm
> why I can't build certificate with one 64 or 128 bits size RSA key?
Because it could be cracked almost immediately. :)
You are probably confusing RSA keys (which are 1K 2K or 4K typically)
with DES and RC4.
/r$
--
Rich Salz Chief Security Architect
DataPower Technology
On Wed, 13 Mar 2002 [EMAIL PROTECTED] wrote:
> Hello,
>
> I am trying to use the OpenSSL library to pull the RSA key material from a
> known RSA key pair. What I would like to get is the private key material,
> the public modulus, and the exponent in BER or DER format.
>
> Any ideas, help in the
Hmm... 160-bit public exponent ... that is a little strange. It sounds like
the requirement for a (relatively weak) Diffie-Hellman exponent, not an RSA
exponent. I know of no weaknesses with using any of the small RSA encrypt
exponents (such as
3, 17, 65537), as long as the random padding of PKCS#
10 novembre 2000 09:21
To: [EMAIL PROTECTED]
Subject: Re: RSA key generation on Windows
On Wed, Nov 08, 2000 at 12:00:57PM +0100, Frédéric Gariador wrote:
> I'd like to use Openssl to generate a RSA key pair on Window NT.
>
> I wonder about some issues :
>
> - I use the -ra
On Wed, Nov 08, 2000 at 12:00:57PM +0100, Frédéric Gariador wrote:
> I'd like to use Openssl to generate a RSA key pair on Window NT.
>
> I wonder about some issues :
>
> - I use the -rand option to specify files used to seed the random number
> generator.
> According to the number of these fil
> I need to create an RSA (or DSA) key structure in C++ program given the
> fact that the key is stored in external file. This key will be the
> public key used for the verification of the digital signature. I have
> browsed the crypto(3) online documentation but I have found no easy way
> of doi
Pinca George wrote:
>
> Hello World ,
>
> I saved a RSA key in DER format , whan I parse it I get something like this
> :
[stuff deleted]
>
> So the first integer After 0 is the modulus, then is the public exponent,
> and then ?
> Which is the private exponent I'll use for decrypting ?
>
The
55 matches
Mail list logo
