- Write a function to compute permutation of a given string. Apply your function to generate all the permutations of the english alphabet (i.e. "abcdefghijklmnopqrstuvwxyz").
- Write a function to compute a^b mod N, using the repeated multiplication modulo N method
- Write a function to compute a^b mod N, using the repeated squaring modulo N method
- Write a function to generate a random number, n, between 2^63 and 2^64, and check whether it is a Prime or not using Fermat's Theorem (i.e. 2^(n-1) mod n ==1?, 3^(n-1) mod n ==1?, 5^(n-1) mod n ==1?, 7^(n-1) mod n ==1?, 11^(n-1) mod n ==1?). You have to use the function in (3) for this purpose.
abhinavanandthakur/cryptography
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|