scientific article; zbMATH DE number 2081083
From MaRDI portal
zbMath1064.11079MaRDI QIDQ4474195
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480495.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, Efficient pairing computation on supersingular abelian varieties, Easy Decision Diffie-Hellman Groups, An improved two-party identity-based authenticated key agreement protocol using pairings, Montgomery Ladder for All Genus 2 Curves in Characteristic 2, Improved Pollard rho method for computing discrete logarithms over finite extension fields, Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield, ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Ordinary Abelian varieties having small embedding degree, Algebraic curves and cryptography, Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications, A pairing-based publicly verifiable secret sharing scheme, Fully collusion-resistant traitor tracing scheme with shorter ciphertexts, Formulae for arithmetic on genus 2 hyperelliptic curves, Supersingular hyperelliptic curves of genus 2 over finite fields, Koblitz curve cryptosystems, Indiscreet logarithms in finite fields of small characteristic, A New Method for Constructing Pairing-Friendly Abelian Surfaces, An Analysis of the Vector Decomposition Problem, Using abelian varieties to improve pairing-based cryptography, Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
