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/

Global: Zendy Plus annual

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

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we describe a new algorithm for discrete logarithms in small characteristic. This algorithm is based on index calculus and includes two new contributions. The first is a new method for generating multiplicative relations among elements of a small smoothness basis. The second is a new descent strategy that allows us to express the logarithm of an arbitrary finite field element in terms of the logarithm of elements from the smoothness basis. For a small characteristic finite field of size $$Q=p^n$$ , this algorithm achieves heuristic complexity $$L_Q1/4+o1.$$ For technical reasons, unless $$n$$ is already a composite with factors of the right size, this is done by embedding $${\mathbb F}_{Q}$$ in a small extension $${\mathbb F}_{Q^e}$$ with $$e\le 2\lceil \log _p n \rceil $$ .

A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic