z-logo
open-access-imgOpen Access
An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient
Author(s) -
Bartosz Źrałek
Publication year - 2018
Publication title -
mathematics of computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.95
H-Index - 103
eISSN - 1088-6842
pISSN - 0025-5718
DOI - 10.1090/mcom/3368
Subject(s) - euler's totient function , mathematics , prime factor , integer (computer science) , factorization , combinatorics , discrete mathematics , euler's formula , modulo , greatest common divisor , prime (order theory) , algorithm , mathematical analysis , computer science , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom