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:
主要作者: | Shereek, Balkees Mohamed |
---|---|
格式: | Thesis |
语言: | English |
出版: |
2016
|
主题: | |
在线阅读: | http://psasir.upm.edu.my/id/eprint/69356/1/FSKTM%202016%2021%20IR.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Enhancement of steganography metrics scheme to assess the quality of image /
由: Frajat, Ali Khadair Kadam
出版: (2011) -
Performance analysis and improvement of rabin primitive based cryptosystems
由: Mahad, Zahari
出版: (2014) -
A modified approach to improve the performance of AES using feistel structure
由: Al-Ansi, Afeef Yahya Ahmed
出版: (2018) -
Key Transformation Approach for Rijndael Security
由: Sulong, Mek Rahmah
出版: (2008) -
An embedded key pin number cryptographic algorithm /
由: Sivasangari Krishnan
出版: (2018)