scientific article

From MaRDI portal

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

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

Publication:3211422

Jump to:navigation, search

zbMath0723.11069MaRDI QIDQ3211422

Publication date: 1990

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

zbMATH Keywords

complexity algorithms integer factorization calculation of discrete logarithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Factorization (11Y05)

Related Items (3)

The Power of Leibniz-Like Functions as Oracles ⋮ An authenticated key scheme over elliptic curves for topological networks ⋮ New Characterization of the Factor Refinement Algorithm with Applications

This page was built for publication:

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