Compression in Finite Fields and Torus-Based Cryptography

DOI10.1137/060676155zbMath1211.94036OpenAlexW2022337532MaRDI QIDQ3532570

Karl Rubin, Alice Silverberg

Publication date: 28 October 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060676155

zbMATH Keywords

compressionmultiplicative groupsCEILIDHtorus-based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Effective compression maps for torus-based cryptography ⋮ A constructive approach to a conjecture by Voskresenskii ⋮ Non-split toric codes ⋮ You can sign but not decrypt: hierarchical integrated encryption and signature ⋮ Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds) ⋮ An optimal representation for the trace zero subgroup ⋮ Applications to cryptography of twisting commutative algebraic groups ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Message transmission for GH-public key cryptosystem ⋮ Memory optimization techniques for computing discrete logarithms in compressed SIKE