Counting Functions to Generate The Primes in the RSA Algorithm and Diffie-Hellman Key Exchange

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetica...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Faez Ali AL-Maamori, Mazin Saied Rashid
Formato:	Artigo
Idioma:	Inglês
Publicado em:	University of Baghdad 2018-04-01
coleção:	Ibn Al-Haitham Journal for Pure and Applied Sciences
Assuntos:	(RSA algorithm and Diffie-Hellman exchange, Beurling Primes, Analytic number theory).
Acesso em linha:	https://jih.uobaghdad.edu.iq/index.php/j/article/view/1805
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!