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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2016
|
| 主题: | |
| 在线阅读: | http://psasir.upm.edu.my/id/eprint/69356/1/FSKTM%202016%2021%20IR.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|