Algorithmic Number Theory
From MaRDI portal
Publication:5465627
DOI10.1007/b98210zbMath1125.94328OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465627
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (7)
Twisting commutative algebraic groups ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ An optimal representation for the trace zero subgroup ⋮ Applications to cryptography of twisting commutative algebraic groups ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Point compression for the trace zero subgroup over a small degree extension field
This page was built for publication: Algorithmic Number Theory