Modified Miller-Rabin primality test algorithm to detect prime numbers for generating RSA keys
A prime number is a number that is only divisible by one and itself, which is essentially saying that it has no divisor. Prime numbers are important in the security field because many encryption algorithms are based on the fact that it is very easy to multiply two large prime numbers and get the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2016
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/69356/1/FSKTM%202016%2021%20IR.pdf http://psasir.upm.edu.my/id/eprint/69356/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|