Yes, I noticed that, I'm using 2048 in production, and I'll start using urandom too. But that's not my problem, currently I'm focusing on other things, so I'll just wait, meanwhile if someone find anything, it's all good, otherwise when I need I'll ask for that other RSA implementation.<br>
<br><div class="gmail_quote">On Tue, Feb 10, 2009 at 10:32 PM, Dwayne C. Litzenberger <span dir="ltr"><<a href="mailto:dlitz@dlitz.net" target="_blank">dlitz@dlitz.net</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
On Mon, Feb 09, 2009 at 10:36:40AM -0200, Mauricio Arozi wrote:<br>
>Am I helpless?<br>
<br>
I think the problem is that you're asking the mailing list for the *Python*<br>
Cryptography Toolkit about how to use an obscure *PHP* library.<br>
<br>
We can help with the Python side of things. I wouldn't expect the people<br>
here to know and/or care much about PHP.<br>
<div><br>
> According to this site: <a href="http://pajhome.org.uk/crypt/rsa/rsa.html" target="_blank">http://pajhome.org.uk/crypt/rsa/rsa.html</a>, and<br>
> yet others, the e(exponent?) is used for the public key, and d for the<br>
> private key.<br>
<br>
</div>The notation I've seen most often is something like this:<br>
<br>
n - modulus (public)<br>
e - public exponent<br>
d - private exponent<br>
(n, e) - public key<br>
(n, d) - private key<br>
(p, q) - the (private) primes from which the keypair is derived.<br>
<br>
PyCrypto uses a similar notation:<br>
<div><br>
from Crypto.PublicKey import RSA<br>
</div> import os<br>
<br>
# DO NOT USE RandomPool (see below)<br>
keypair = RSA.generate(2048, os.urandom)<br>
<br>
print "PRIVATE KEYPAIR:"<br>
print "n:", keypair.n # modulus (public)<br>
print "e:", keypair.e # public exponent<br>
print "d:", keypair.d # private exponent<br>
print "p:", keypair.p # prime (private)<br>
print "q:", keypair.q # other prime (private)<br>
print "u:", keypair.u # I forget what this for (but it's private)<br>
<br>
pub = keypair.publickey()<br>
print ""<br>
print "PUBLIC KEY:"<br>
print "n (pub):", pub.n # modulus (public)<br>
print "e (pub):", pub.e # public exponent<br>
print "d (pub):", pub.d # raises an exception<br>
print "p (pub):", pub.p # raises an exception<br>
print "q (pub):", pub.q # raises an exception<br>
print "u (pub):", pub.u # raises an exception<br>
<br>
This outputs the following:<br>
<br>
PRIVATE KEYPAIR:<br>
n: 277...[truncated]<br>
e: 65537<br>
d: 232...[truncated]<br>
p: 159...[truncated]<br>
q: 174...[truncated]<br>
u: 125...[truncated]<br>
<br>
PUBLIC KEY:<br>
n (pub): 277...[truncated]<br>
e (pub): 65537<br>
d (pub):<br>
Traceback (most recent call last):<br>
File "x.py", line 21, in ?<br>
print "d (pub):", pub.d<br>
File "/usr/lib/python2.4/site-packages/Crypto/PublicKey/RSA.py", line 154, in __getattr__<br>
return getattr(self.key, attr)<br>
AttributeError: rsaKey instance has no attribute 'd'<br>
<div><br>
> My problem is that while using PyCrypto to generate both public and<br>
> private keys, the e(exponent?) is always the same.<br>
<br>
</div>Mads Kiilerich already talked a bit about this, but I won't go into detail.<br>
What you're describing here is normal, and it really helps improve the<br>
performance of encryption/verification.<br>
<br>
If you're concerned about the security of using RSA, I suggest reading Dan<br>
Boneh's 1999 article, "Twenty years of attacks on the RSA cryptosystem":<br>
<br>
<a href="http://crypto.stanford.edu/%7Edabo/abstracts/RSAattack-survey.html" target="_blank">http://crypto.stanford.edu/~dabo/abstracts/RSAattack-survey.html</a><br>
<div><br>
>So in simple words, I only need to be able to encrypt/decrypt sign and<br>
>verify signs on php and python, simultaneously, if possible, using RSA<br>
>algo.<br>
<br>
</div>PyCrypto's PublicKey package is very low-level, so people shouldn't use it<br>
directly unless they REALLY know what they are doing. Mere mortals should<br>
use a separate library in addition to PyCrypto for that. You should never<br>
do anything like this:<br>
<div><br>
>privkeyA = RSA.generate(512, rpool.get_bytes)<br>
>pubkeyA = privkeyA.publickey()<br>
><br>
>msg = 'This is the secret phrase testing.'<br>
>msgc = pubkeyA.encrypt(msg, '')<br>
<br>
</div>That is called "textbook RSA", and it's insecure. (Also, it uses a 512-bit<br>
key, which is way too short, but I assume that's just for demonstration.)<br>
I strongly recommend looking at PKCS#1v2 (also known as RSAES-OAEP).<br>
PyCrypto doesn't include an implementation yet, but Sergey Chernov<br>
mentioned that he is working on one.<br>
<br>
Also, I noticed in your code that you used RandomPool. Don't. RandomPool<br>
is a security disaster, and it will be removed from future versions. See<br>
the following messages:<br>
<br>
<a href="http://lists.dlitz.net/pipermail/pycrypto/2008q3/000000.html" target="_blank">http://lists.dlitz.net/pipermail/pycrypto/2008q3/000000.html</a><br>
<a href="http://lists.dlitz.net/pipermail/pycrypto/2008q3/000020.html" target="_blank">http://lists.dlitz.net/pipermail/pycrypto/2008q3/000020.html</a><br>
<br>
I hope you find the above information helpful.<br>
<br>
Cheers,<br>
- Dwayne<br>
<font color="#888888"><br>
--<br>
Dwayne C. Litzenberger <<a href="mailto:dlitz@dlitz.net" target="_blank">dlitz@dlitz.net</a>><br>
Key-signing key - 19E1 1FE8 B3CF F273 ED17 4A24 928C EC13 39C2 5CF7<br>
Annual key (2008) - 4B2A FD82 FC7D 9E38 38D9 179F 1C11 B877 E780 4B45<br>
</font><div><div></div><div>_______________________________________________<br>
pycrypto mailing list<br>
<a href="mailto:pycrypto@lists.dlitz.net" target="_blank">pycrypto@lists.dlitz.net</a><br>
<a href="http://lists.dlitz.net/cgi-bin/mailman/listinfo/pycrypto" target="_blank">http://lists.dlitz.net/cgi-bin/mailman/listinfo/pycrypto</a><br>
</div></div></blockquote></div><br>