Algorithmic Number Theory

DOI10.1007/b98210zbMath1125.11358OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465622

Robert Granger, Frederik Vercauteren, Andrew J. Holt, Dan Page, Nigel 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

supersingular elliptic curvesdiscrete logarithms in finite fieldsefficiency of function field sieve

Mathematics Subject Classification ID

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

Related Items (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