4   Artículos

 
en línea
Mohammad Andri Budiman, Dian Rachmawati     Pág. 45 - 52
Abstract. The security of the RSA cryptosystem is directly proportional to the size of its modulus, n. The modulus n is a multiplication of two very large prime numbers, notated as p and q. Since modulus n is public, a cryptanalyst can use factorization ... ver más

 
en línea
Ade Candra, Mohammad Andri Budiman, Dian Rachmawati     Pág. 30 - 37
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a... ver más

« Anterior     Página: 1 de 1     Siguiente »