Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.94345OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899269

Gerhard Frey, Tanja Lange

Publication date: 2 May 2007

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

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

zbMATH Keywords

hyperelliptic curvesPublic key cryptographypairingsfast computationTate pairing

Mathematics Subject Classification ID

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

Related Items (4)

Efficient pairing computation on supersingular abelian varieties ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

Uses Software

• HECC

This page was built for publication: Algorithmic Number Theory