Function field sieve in characteristic three

DOI10.1007/978-3-540-24847-7_16MaRDI QIDQ5465622zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

discrete logarithms in finite fieldsefficiency of function field sievesupersingular elliptic curves

Mathematics Subject Classification ID

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

Recommendations

• The Function Field Sieve in the Medium Prime Case
• The function field sieve is quite special
• Function field sieve method for discrete logarithms over finite fields
• Cryptography and Coding
• scientific article; zbMATH DE number 1408416

Cited in

(2)

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

This page was built for publication: Function field sieve in characteristic three

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