Faster way to use RSA...
From: Beta-Ray Bill (nSePtAnMeSwUsC@KaSttbi.com)
Date: 03/30/03
- Next message: Tom St Denis: "Re: Faster way to use RSA..."
- Previous message: Mok-Kong Shen: "Re: Conference: A New Kind of Science"
- Next in thread: Tom St Denis: "Re: Faster way to use RSA..."
- Reply: Tom St Denis: "Re: Faster way to use RSA..."
- Reply: Scott Fluhrer: "Re: Faster way to use RSA..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: "Beta-Ray Bill" <nSePtAnMeSwUsC@KaSttbi.com> Date: Sun, 30 Mar 2003 21:22:43 GMT
Ease of attack for RSA is based on not being able to factor N (N = PxQ) due
to N being known to all (e.g. (e,N) is my private key and (d,N) being my
public
key).
As computers get faster RSA users must select P and Q values that are larger
to remain safe(r).
My questions are as follows:
1. If N could be kept secret (e.g. just between the people who communicate)
then would RSA key sizes stop increasing?
2. Can cryptoanalysis determine the value of N from analysis of the
ciphertext without knowledge of the public key, which of course contains
N?
3. Would using RSA with smaller P and Q values (i.e. smaller N) to encrypt a
message be easier to attack compared to a message encrypted using larger
P and
Q values IF AND ONLY IF the value of smaller N could be kept secret?
4. Doesn't large N values drive up the time to encrypt/decrypt a message?
Why doesn't someone select smaller P and Q values, which result in faster
encryption, and generate e and d. Encrypt a message using smaller P and Q, e
and d. Bob
could use RSA in the standard way (e.g. with large P, Q and large N) to send
smaller P and Q, e
and d to Alice. Bob would also send the encrypted message as well. Alice
would reverse the
process. Wouldn't the attacker then have to brute force pick smaller P and Q
pairs
and for each further test multiple e and d pairs to find solutions?
After all, RSA is a very clever way to reconstruct a value from knowing its
remainder and the decryption key - of course.
I didn't see this in the FAQ.
Thanks in advance...
Bill
- Next message: Tom St Denis: "Re: Faster way to use RSA..."
- Previous message: Mok-Kong Shen: "Re: Conference: A New Kind of Science"
- Next in thread: Tom St Denis: "Re: Faster way to use RSA..."
- Reply: Tom St Denis: "Re: Faster way to use RSA..."
- Reply: Scott Fluhrer: "Re: Faster way to use RSA..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|