Description eulerphi(p) computes the Euler s Totient Function of p where p is a positive integer and eulerphi(1)=1 by definition. invmodn(x,p) computes the inverse modulo of x under p using repeated multiplication technique.This function can work for a long range of numbers. CRT(r,p) computes the value of the system of equations that is described in the summary. invmodn funtion comes in handy for use in RSA algorithm.

CRT.m
eulerphi.m
invmodn.m
license.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．