Description: This program uses the Euclidean Algorithm for Finding multiplicative inverse, using the binary decomposition algorithm for getting a ^ b mod n, algorithm concise, clear, for in-depth understanding of the basic principles of the program, run the demo file directly to complete the program running
To Search:
File list (Check if you may need any files):
RSA加密解密简易程序\addsec.m
...................\demo.m
...................\erjinzhi.m
...................\invmod.m
...................\makekey.m
...................\mymod.m
...................\removesec.m
RSA加密解密简易程序