Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1 Publication

2004 | Book Chapter | LibreCat-ID: 3015
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg.
LibreCat | DOI

Filters and Search Terms



Filter Publications

Display / Sort

Citation Style: APA

Export / Embed