scientific article

From MaRDI portal

Revision as of 21:08, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2998505

Jump to:navigation, search

zbMath1235.11116MaRDI QIDQ2998505

Reynald Lercier, Antoine Joux

Publication date: 18 May 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity finite field cryptography discrete logarithm problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20)

Related Items (2)

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Selecting polynomials for the Function Field Sieve

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2998505&oldid=16015314"