id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
iajs-1805	AL-Maamori, Faez Ali; Rashid, Mazin Saied	Counting Functions to Generate The Primes in the RSA Algorithm and Diffie-Hellman Key Exchange	2018	5	.pdf	application/pdf	1384	79	64	The function F(x) is increasing step function. Therefore, the step function 𝐹∗ 𝑥 is either zero or prime number.	cache/iajs-1805.pdf	txt/iajs-1805.txt