Hi Rohit, > uses EncryptionScheme objects [e, n]. I believe these are courtesy of InvertibleRSAFunction
> will it be odd if I use EncryptionScheme objects in > SignatureScheme RSA code I don't have a reference handy (Handbook of Applied Cryptography), but I believe the authors recommend two pairs of RSA keys: the first for encryption, and the second for signing. Jeff On 3/4/08, Rohit <[EMAIL PROTECTED]> wrote: > > Hi Jeff, > > I am sorry for the previous email. Actually, I somehow skipped > RSAdumpkeys example. Now, I am able to get e and n through that > example code. Thanks. And, just one simple (maybe stupid) query : I am > using SignatureScheme of RSA and that example code uses > EncryptionScheme objects. Components e and n of public key will always > be same irrespective of the scheme I use. But, will it be odd if I use > EncryptionScheme objects in SignatureScheme RSA code I am trying to > extract? > > Thanks. > > ~Rohit~ > > > On Mar 4, 10:57 am, Rohit <[EMAIL PROTECTED]> wrote: > > Hi Jeff, > > > > Thanks for the reply. > > > > But, this is not what I am looking for. I generated public key from > > crypto++ as given below: > > > > [SNIP] > > > > I fed this public key (alongwith message and signature) into > > RSAVerifyFile API (in test.cpp). I want to know how crypto++ > > separates e and n from this and feeds into a_exp_b_mod_c func in > > RSAFunction::ApplyFunction (in rsa.cpp) so as to verify a given > > signature? > > > > Thanks. > > > > ~Rohit~ > > > > On Mar 3, 8:36 pm, "Jeffrey Walton" <[EMAIL PROTECTED]> wrote: > > > > > Hi Rohit, > > > > >http://www.cryptopp.com/wiki/RSA > > > > > Jeff > > > > > On 3/3/08, Rohit <[EMAIL PROTECTED]> wrote: > > > > > > Hi All, > > > > > > I am interested in extracting RSA code from Crypto++. I want to verify > > > > signature (of hash of some file) using RSAVerifyFile API. I would like > > > > to know how are public exponent (e) and modulus (n) extracted from the > > > > public key fed to RSAVerifyFile. RSAFunction::ApplyFunction contains > > > > a_exp_b_mod_c which basically performs (a^b mod c) using signature, e > > > > and n. Can anyone please tell from where and how e and n are coming > > > > actually? > > > > > > Thanks a lot! > > > > > > ~Rohit~ > > > --~--~---------~--~----~------------~-------~--~----~ 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. -~----------~----~----~----~------~----~------~--~---
