List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient Mathematics of Computation | 2019-01-31 | Paper |
| On computing discrete logarithms in bulk and randomness extractors Fundamenta Informaticae | 2016-08-15 | Paper |
| On reducing factorization to the discrete logarithm problem modulo a composite Computational Complexity | 2012-08-24 | Paper |
| Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\) Mathematics of Computation | 2010-10-08 | Paper |
| A deterministic version of Pollard's \(p-1\) algorithm Mathematics of Computation | 2010-08-30 | Paper |
| Using the smoothness of p-1 for computing roots modulo p | 2008-03-04 | Paper |
Research outcomes over time
This page was built for person: Bartosz Źrałek
