Efficiently Computable Distortion Maps for Supersingular Curves

DOI10.1007/978-3-540-79456-1_5zbMath1232.11076OpenAlexW1533926093MaRDI QIDQ3502729

Katsuyuki Takashima

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_5

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (3)

A survey on functional encryption ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Distortion maps for supersingular genus two curves

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• On the structure of the divisor class group of a class of curves over finite fields
• Distortion maps for supersingular genus two curves
• Easy Decision Diffie-Hellman Groups
• Hyperelliptic Pairings
• Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians

This page was built for publication: Efficiently Computable Distortion Maps for Supersingular Curves