Starting to be able to reverse engineer RSA functions: For N, to create the co-modulus, add Phi(N) to Phi. If the gcd N and Phi(N) is equal to one, then they are coprime.
This becomes increasingly impractical for large bit numbers though. #RSA #pki
Starting to be able to reverse engineer RSA functions: For N, to create the co-modulus, add Phi(N) to Phi. If the gcd N and Phi(N) is equal to one, then they are coprime.
This becomes increasingly impractical for large bit numbers though. #RSA #pki
Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.
All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.