R-prime numbers of degree k

Abdelhakim Chillali

Abstract


In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. Not being one-to-one is not considered sufficient of a function for it to be called one-way (see Theoretical Definition, in article). A twin prime is a prime number that has a prime gap of two, in other words, differs from another prime number by two, for example the twin prime pair (5,3). The question of whether there exist infinitely many twin primes has been one of the great open questions in number theory for many years. This is the content of the twin prime conjecture, which states: There are infinitely many primes p such that p + 2 is also prime. In this work we define a new notion: ‘r-prime number of degree k’ and   we give a new RSA trap-door one-way. This notion generalized a twin prime numbers because the twin prime numbers are 2-prime numbers of degree 1.

Keywords


RSA; Prime Number; One-Way function; Cryptography

Full Text:

PDF


DOI: http://dx.doi.org/10.5269/bspm.v38i2.38218



Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

ISSN 0037-8712 (print) and ISSN 2175-1188 (on-line)

 

Resultado de imagem para CC BY