Using primitive subgroups to do more with fewer bits

DOI10.1007/978-3-540-24847-7_2MaRDI QIDQ5465627zbMATH OpenOpenAlexFDO

Authors Karl Rubin, Alice Silverberg

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

Mathematics Subject Classification ID

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

Recommendations

• Applications to cryptography of twisting commutative algebraic groups
• Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields
• On the Discrete Logarithm Problem on Algebraic Tori
• Practical Cryptography in High Dimensional Tori
• Asymptotically optimal communication for torus-based cryptography

Cited in

(8)

• 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
• Twisting commutative algebraic groups
• Efficient pairing computation on supersingular abelian varieties
• Constructing pairing-friendly hyperelliptic curves using Weil restriction
• scientific article; zbMATH DE number 2154291 (Why is no real title available?)
• An optimal representation for the trace zero subgroup

This page was built for publication: Using primitive subgroups to do more with fewer bits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465627)