Distribution of powers modulo p and security of RSA
Article
Article
Let p be a prime and a be any fixed positive integer such that gcd(a, φ(p)) = 1. For 0 < x
LCC LCC:MathematicsIdioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access