RSA: Find "d" - how to code this? (-> extended Euclidean algorithm)

Discussion in 'Chit Chat' started by KMatle, Jan 23, 2015.

  1. KMatle

    KMatle Expert Licensed User

    As some of you maybe have read, I am going to develop a RSA (lib) for B4x and (more important) a php script. This would be a great step for b4x because we then are able to exchange keys SAFE.

    Agrahams lib supports RSA but it is very difficult to match it to the server-side (different reasons like: SSL has to be buyed from your hoster, many functions like OpenSSL or other RSA solutions can't be used, etc.)

    I'm almost there, except my ability to get this into code (I did not find good sources).

    See this thread: http://crypto.stackexchange.com/que...en-given-public-exponent-and-the-modulus-fact

    Anyone?

     
Loading...
  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice