Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1125.11358OpenAlexW2791103999MaRDI QIDQ5465622FDOQ5465622

Authors: Robert Granger, Andrew J. Holt, Frederik Vercauteren, Dan Page, N. P. Smart 

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98210

Recommendations

• The Function Field Sieve in the Medium Prime Case
• scientific article; zbMATH DE number 2086903
• Function field sieve method for discrete logarithms over finite fields
• Cryptography and Coding
• Publication:4941233

zbMATH Keywords

supersingular elliptic curvesdiscrete logarithms in finite fieldsefficiency of function field sieve

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (2)

• A comparison of MNT curves and supersingular curves
• The Function Field Sieve in the Medium Prime Case

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465622)