There is no complete implementation of XTR-ElGamal in Crypto++, but you can estimate the times pretty easily from the XTR-DH benchmarks. ElGamal encryption is roughly equivalent to DH key generation plus key agreement. Decryption is roughly equivalent to DH key agreement.
BTW, on another note, I just noticed that the DLIES decryption benchmark numbers at http://www.cryptopp.com/benchmarks.html are way too high, due to the private exponents in the private key files (dlie1024.dat and dlie2048.dat) being too long. The current key generation code in Crypto++ 5.5.2 does generate the correct short exponents, so I just need to generate new keys and redo the benchmarks. -------------------------------------------------- From: "Christian" <[EMAIL PROTECTED]> Sent: Friday, December 07, 2007 11:09 PM To: "Crypto++ Users" <[EMAIL PROTECTED]> Subject: RSA and XTR Benchmarks > > Hello, > First of all I would like to apologize if my questions seem trivial, > but I am not an expert in cryptography and I am trying to get familiar > with the crypto c++ library. > I am trying to do a speed comparison between XTR and RSA algorithms. > My question is: > How could I use XTR to create an XTR-ElGamal implementation. Do I pass > any special parameter or I would have to rewrite the implementation to > use the DH-XTR Key agreement protocol? > Again, Please apologize if the question is trivial or obvious. > Regards, > Christian Zarate > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the "Crypto++ Users" Google Group. To unsubscribe, send an email to [EMAIL PROTECTED] More information about Crypto++ and this group is available at http://www.cryptopp.com. -~----------~----~----~----~------~----~------~--~---
