is it sufficient to solve factoring problem

When I read the textbook, a scenario comes across my mind with
confusion as follow:

If we know modulus N, public exponent e, secret exponent d, of RSA
scheme. Is it sufficient to solve factoring problem? or find exact what
the phi(N) is ?

.

Relevant Pages

  • Re: RSA Decryption with CryptoAPI, key in PEM format
    ... in the format CAPI understands. ... Your code blindly set the public exponent to 65537 - which is ... I reversed the byte order of the key modulus as you suggested, ... PUBLICKEYBLOB format which is a C struct with several elements. ...
    (microsoft.public.platformsdk.security)
  • Help with OpenSSL RSA
    ... I'm writing a little code to do some RSA stuff and I need to extract the ... public exponent and modulus for passing to a browser that will use them ... I can't find suitable documentation so I don't know what method ...
    (comp.lang.ruby)
  • Re: Help with OpenSSL RSA
    ... I'm writing a little code to do some RSA stuff and I need to extract the ... public exponent and modulus for passing to a browser that will use them ... I can't find suitable documentation so I don't know what method ...
    (comp.lang.ruby)
  • Re: is it sufficient to solve factoring problem
    ... an RSA key pair with a 100 bit long modulus. ... private exponent 'd' = 419137041797792997701877718877 ...
    (sci.crypt)
  • Re: is it sufficient to solve factoring problem
    ... Christian Siebert a écrit: ... an RSA key pair with a 100 bit long modulus. ...
    (sci.crypt)