English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We report on two new records: the factorization of RSA-240, a 795-bit number,and a discrete logarithm computation over a 795-bit prime field. Previousrecords were the factorization of RSA-768 in 2009 and a 768-bit discretelogarithm computation in 2016. Our two computations at the 795-bit level weredone using the same hardware and software, and show that computing a discretelogarithm is not much harder than a factorization of the same size. Moreover,thanks to algorithmic variants and well-chosen parameters, our computationswere significantly less expensive than anticipated based on previousrecords.The last page of this paper also reports on the factorization ofRSA-250.

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment