Algorithmic Number Theory

DOI10.1007/B98210MaRDI QIDQ5465631zbMATH OpenOpenAlexFDO

Authors Tanja Lange

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

Hyperelliptic curvesfast arithmeticcryptographic applicationsMontgomery arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) [https://portal.mardi4nfdi.de/w/index.php?search=%2211G30%22&title=Special%3ASearch&profile=advanced&fulltext=1&ns120=1 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Montgomery Ladder for All Genus 2 Curves in Characteristic 2
• Algorithmic Number Theory
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
• Fast addition formulae for Montgomery ladder scalar multiplication on hyperelliptic curves

Cited in

(5)

• SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2
• Montgomery Ladder for All Genus 2 Curves in Characteristic 2
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Algorithmic Number Theory
• Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic

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 Q5465631)