On Mon, 10 Oct 2011 23:18, jw72...@verizon.net said:
keys in turn. Is there a way to tell gpg to use just one of the keys if
any? I have tried specifying this as one of the options -u userID, but it
No there is no way to do this.
The best suggestion for all automated systems is not to use a
Hi,
How can I use a GnuPG card on multiple computers?
My understanding is that when I let the card generate the keys, a stub
for each key pair is automatically added to my keyring and instructs gpg
to use the card to encrypt my messages. How can I add such stubs to my
keyring on a different
On Tue, 11 Oct 2011 09:37, urs.hunke...@epfl.ch said:
gpg to use the card to encrypt my messages. How can I add such stubs
to my keyring on a different computer to point to existing keys on my
card without having to regenerate the keys (which would render the
You insert the card on that other
On 2011-10-10 23:29, Jan Janka wrote:
How long would it take to execute a successful brute force attack on
a pasphrase consisting of 12 symbols (symbols available on common
keyboards)?
Calculate how many combinations there are, assume some number of tries
per second (you can experimentally
Hi Werner,
Thanks a lot!
Cheers,
Urs
On 10/11/11 11:03 AM, Werner Koch wrote:
On Tue, 11 Oct 2011 09:37, urs.hunke...@epfl.ch said:
gpg to use the card to encrypt my messages. How can I add such stubs
to my keyring on a different computer to point to existing keys on my
card without having
Sethukumar Ramachandran * Technical Lead * SunGard * Global Services *
Divyasree Chambers, Langford Road, Bangalore 560025, India
Tel : +91-80- 0501 * Mobile: +91-9980012150 *
www.sungard.com/stshttp://www.sungard.com/sts
___
Gnupg-users mailing
Jerome Baum jerome+per...@jeromebaum.com writes:
On 2011-10-10 23:29, Jan Janka wrote:
How long would it take to execute a successful brute force attack on
a pasphrase consisting of 12 symbols (symbols available on common
keyboards)?
Calculate how many combinations there are, assume
On 3. 10. 2011 23:59, David Shaw wrote:
On Oct 3, 2011, at 1:49 PM, pet jemen wrote:
Hi,
I want to sign binary data in OpenPGP Message Format.
I want sign it by two or more keys.
According to http://tools.ietf.org/html/rfc4880#section-5.4 it seems it is
possible.
(A one-octet number
On 10/10/2011 5:44 PM, Jerome Baum wrote:
But remember Murphy's(?) law! -- (I mean the one about doubling computer
power every 18 months -- are there two Murphy's laws? Confused now...)
Moore's Law.
For reference, a 40-bit key is breakable today by just about anyone, a
64-bit key is breakable
On Mon, Oct 10, 2011 at 5:44 PM, Jerome Baum
jerome+per...@jeromebaum.com wrote:
On 2011-10-10 23:29, Jan Janka wrote:
How long would it take to execute a successful brute force attack on
a pasphrase consisting of 12 symbols (symbols available on common
keyboards)?
Calculate how many
David Tomaschik wrote (in part):
If you value your OpenPGP key, I would not trust it to 24 bits of
entropy. My off-card backup of my key is protected by a 32-character
passphrase that I believe to be highly resistant to dictionary
attack (and contains sufficient special characters that I
On 10/11/11 9:41 AM, Jean-David Beyer wrote:
But in a sense, was it not unwise to tell me your passphrase length? I
will now set up my hypothetical exhaustive search cracker not to bother
with passphrases less than 32 characters or longer than 32 characters.
This reduces the size of the search
-- Forwarded message --
From: Robert J. Hansen r...@sixdemonbag.org
To: Jerome Baum jerome+per...@jeromebaum.com, gnupg-users@gnupg.org
Date: Tue, 11 Oct 2011 08:27:47 -0400
Subject: Re: Why revoke a key?
On 10/10/2011 5:44 PM, Jerome Baum wrote:
But remember Murphy's(?)
John A. Wallace jw72253 at verizon.net wrote on
Mon Oct 10 23:18:21 CEST 2011 :
Is there a way to tell gpg to use just one of the keys if
any? I have tried specifying this as one of the options -u
userID, but it seems to ignore my specification and it always
tries to use a different key from
On Tue, 11 Oct 2011 13:55, pje...@gmail.com said:
Other problem I've noticed when I signed file in non-batch mode is that
I’ve specified to use SHA512 for second signature.
You didn't. What you did is to specify an S2K hash algorithm which is
used to turn passphrases into keys. Further it is
Hi,
Another developer and I have downloaded and compiled and built the versions of
gpg listed. I have generated the keys successfully and when I try running gpg
as a test to encrypt a file I am getting bus errors. I have started the agent
as you can see below as well. I also did a list-keys
Accurate to 6%, there are 2**25 seconds in a year. Worth remembering:
it makes certain kinds of computations much easier. (It follows there
would be about 2**35 seconds in a thousand years, or 2**45 seconds in a
million.)
E.g., let's say you want to brute-force an 64-bit key on a CPU that can
Robert J. Hansen wrote:
Accurate to 6%, there are 2**25 seconds in a year. Worth remembering:
it makes certain kinds of computations much easier. (It follows there
would be about 2**35 seconds in a thousand years, or 2**45 seconds in a
million.)
E.g., let's say you want to brute-force an
On 2011-10-11 16:54, Robert J. Hansen wrote:
Okay, fine: you can exclude all six-digit numbers (900,000 of them), all
five-digit numbers (90,000 of them), all four-digit numbers (9,000 of
them), all three-digit numbers (900 of them), all two-digit numbers (90
of them) and all one-digit numbers
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
Hi
On Tuesday 11 October 2011 at 9:32:18 PM, in
mid:4e94a7d2.7060...@sixdemonbag.org, Robert J. Hansen wrote:
Accurate to 6%, there are 2**25 seconds in a year.
[...]
I don't know why it took me so long to notice that:
seems like the sort
20 matches
Mail list logo
