Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94400OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428130

Karl Rubin, Alice Silverberg

Publication date: 28 November 2007

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (19)

Effective compression maps for torus-based cryptography ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ On Compressible Pairings and Their Computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Efficient Multiplication in Finite Field Extensions of Degree 5 ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ An optimal representation for the trace zero subgroup ⋮ Efficient Compression of SIDH Public Keys ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ VSH, an Efficient and Provable Collision-Resistant Hash Function ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Applications to cryptography of twisting commutative algebraic groups ⋮ Point Decomposition Problem in Binary Elliptic Curves ⋮ Refined analysis to the extended tower number field sieve ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Point compression for the trace zero subgroup over a small degree extension field ⋮ Message transmission for GH-public key cryptosystem ⋮ An overview of trace based public key cryptography over finite fields

This page was built for publication: Advances in Cryptology - CRYPTO 2003